./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:55,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:55,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:55,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:55,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:55,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:55,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:55,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:55,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:55,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:55,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:55,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:55,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:55,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:55,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:55,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:55,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:55,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:55,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:55,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:55,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:55,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:55,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:55,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:55,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:55,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:55,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:55,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:55,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:55,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:55,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:55,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:55,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:55,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:55,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:55,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:55,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:55,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:55,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:55,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:55,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:55,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:53:55,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:55,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:55,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:55,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:55,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:55,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:55,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:55,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:55,311 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:55,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:55,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:55,312 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:55,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:55,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:55,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:55,313 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:55,313 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:55,314 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:55,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:55,314 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:55,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:55,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:55,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:55,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:55,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:55,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:55,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:55,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:55,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:53:55,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:53:55,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2022-02-20 23:53:55,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:55,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:55,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:55,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:55,543 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:55,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-02-20 23:53:55,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8723b771e/d20e4bf14a034457926f248ba25d1720/FLAGc10e7fa6d [2022-02-20 23:53:56,075 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:56,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-02-20 23:53:56,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8723b771e/d20e4bf14a034457926f248ba25d1720/FLAGc10e7fa6d [2022-02-20 23:53:56,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8723b771e/d20e4bf14a034457926f248ba25d1720 [2022-02-20 23:53:56,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:56,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:56,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:56,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:56,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:56,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5b6a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56, skipping insertion in model container [2022-02-20 23:53:56,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:56,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:56,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-02-20 23:53:56,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-02-20 23:53:56,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-02-20 23:53:56,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-02-20 23:53:56,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-02-20 23:53:56,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-02-20 23:53:56,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-02-20 23:53:56,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:56,748 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:53:56,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-02-20 23:53:56,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-02-20 23:53:56,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-02-20 23:53:56,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-02-20 23:53:56,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-02-20 23:53:56,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-02-20 23:53:56,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-02-20 23:53:56,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:56,825 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:53:56,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56 WrapperNode [2022-02-20 23:53:56,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:56,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:56,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:53:56,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:53:56,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,891 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-02-20 23:53:56,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:56,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:53:56,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:53:56,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:53:56,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:53:56,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:53:56,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:53:56,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:53:56,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (1/1) ... [2022-02-20 23:53:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:53:56,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:53:56,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:53:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:53:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:53:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:53:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:53:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:53:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:53:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:53:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:53:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:53:56,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:53:57,068 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:53:57,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:53:57,646 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:53:57,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:53:57,654 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 23:53:57,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:57 BoogieIcfgContainer [2022-02-20 23:53:57,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:53:57,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:53:57,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:53:57,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:53:57,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:56" (1/3) ... [2022-02-20 23:53:57,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7232ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:57, skipping insertion in model container [2022-02-20 23:53:57,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:56" (2/3) ... [2022-02-20 23:53:57,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7232ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:57, skipping insertion in model container [2022-02-20 23:53:57,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:57" (3/3) ... [2022-02-20 23:53:57,664 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2022-02-20 23:53:57,668 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:53:57,669 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-02-20 23:53:57,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:53:57,713 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:53:57,714 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-02-20 23:53:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:53:57,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:57,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:53:57,742 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:53:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:53:57,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:57,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598059226] [2022-02-20 23:53:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:57,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {174#true} is VALID [2022-02-20 23:53:57,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {176#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:53:57,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} assume !(1 == #valid[main_~null~0#1.base]); {175#false} is VALID [2022-02-20 23:53:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:57,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:57,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598059226] [2022-02-20 23:53:57,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598059226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:57,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:57,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:57,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699146875] [2022-02-20 23:53:57,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:57,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:57,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:57,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:57,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:57,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:57,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:57,981 INFO L87 Difference]: Start difference. First operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:58,333 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2022-02-20 23:53:58,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:58,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 23:53:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 23:53:58,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2022-02-20 23:53:58,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:58,591 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:53:58,592 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 23:53:58,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:58,596 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 151 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:58,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 23:53:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2022-02-20 23:53:58,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:58,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,633 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,634 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:58,648 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2022-02-20 23:53:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 203 transitions. [2022-02-20 23:53:58,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:58,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:58,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 196 states. [2022-02-20 23:53:58,652 INFO L87 Difference]: Start difference. First operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 196 states. [2022-02-20 23:53:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:58,661 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2022-02-20 23:53:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 203 transitions. [2022-02-20 23:53:58,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:58,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:58,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:58,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 178 transitions. [2022-02-20 23:53:58,672 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 178 transitions. Word has length 3 [2022-02-20 23:53:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:58,672 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 178 transitions. [2022-02-20 23:53:58,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 178 transitions. [2022-02-20 23:53:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:53:58,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:58,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:53:58,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:53:58,674 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:53:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:53:58,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:58,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656699323] [2022-02-20 23:53:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:58,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {939#true} is VALID [2022-02-20 23:53:58,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {941#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~null~0#1.base|)))} is VALID [2022-02-20 23:53:58,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~null~0#1.base|)))} assume !(4 + main_~null~0#1.offset <= #length[main_~null~0#1.base] && 0 <= main_~null~0#1.offset); {940#false} is VALID [2022-02-20 23:53:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:58,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:58,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656699323] [2022-02-20 23:53:58,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656699323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:58,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:58,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:58,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775702620] [2022-02-20 23:53:58,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:58,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:58,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:58,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:58,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:58,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:58,758 INFO L87 Difference]: Start difference. First operand 170 states and 178 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,032 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 23:53:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:59,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:53:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 23:53:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 23:53:59,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2022-02-20 23:53:59,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:59,190 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:53:59,190 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:53:59,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:59,191 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:59,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 90 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:53:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-02-20 23:53:59,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:59,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,199 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,200 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,204 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 23:53:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 23:53:59,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:59,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:59,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 166 states. [2022-02-20 23:53:59,206 INFO L87 Difference]: Start difference. First operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 166 states. [2022-02-20 23:53:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,211 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 23:53:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 23:53:59,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:59,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:59,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:59,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2022-02-20 23:53:59,218 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 3 [2022-02-20 23:53:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:59,218 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2022-02-20 23:53:59,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 23:53:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:53:59,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:59,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:59,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:53:59,219 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:53:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-02-20 23:53:59,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:59,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841813371] [2022-02-20 23:53:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:59,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {1608#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {1608#true} is VALID [2022-02-20 23:53:59,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1608#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1608#true} is VALID [2022-02-20 23:53:59,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1608#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {1608#true} is VALID [2022-02-20 23:53:59,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {1608#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {1608#true} is VALID [2022-02-20 23:53:59,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {1608#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {1608#true} is VALID [2022-02-20 23:53:59,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {1608#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {1610#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:53:59,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {1610#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(1 == #valid[main_~list~0#1.base]); {1609#false} is VALID [2022-02-20 23:53:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:59,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:59,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841813371] [2022-02-20 23:53:59,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841813371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:59,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:59,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:59,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369559695] [2022-02-20 23:53:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:53:59,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:59,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:59,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:59,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:59,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:59,301 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,524 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2022-02-20 23:53:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:53:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-20 23:53:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-20 23:53:59,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2022-02-20 23:53:59,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:59,675 INFO L225 Difference]: With dead ends: 162 [2022-02-20 23:53:59,675 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 23:53:59,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:59,676 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:59,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 103 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 23:53:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-02-20 23:53:59,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:59,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,692 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,694 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,698 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2022-02-20 23:53:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2022-02-20 23:53:59,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:59,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:59,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 162 states. [2022-02-20 23:53:59,708 INFO L87 Difference]: Start difference. First operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 162 states. [2022-02-20 23:53:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:59,713 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2022-02-20 23:53:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2022-02-20 23:53:59,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:59,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:59,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:59,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2022-02-20 23:53:59,718 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 7 [2022-02-20 23:53:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:59,718 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2022-02-20 23:53:59,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2022-02-20 23:53:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:53:59,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:59,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:59,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:53:59,720 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:53:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-02-20 23:53:59,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:59,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604373085] [2022-02-20 23:53:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:59,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {2259#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {2259#true} is VALID [2022-02-20 23:53:59,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2259#true} is VALID [2022-02-20 23:53:59,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {2259#true} is VALID [2022-02-20 23:53:59,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {2259#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {2259#true} is VALID [2022-02-20 23:53:59,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {2259#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {2259#true} is VALID [2022-02-20 23:53:59,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {2261#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:53:59,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#(and (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(4 + main_~list~0#1.offset <= #length[main_~list~0#1.base] && 0 <= main_~list~0#1.offset); {2260#false} is VALID [2022-02-20 23:53:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:59,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:59,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604373085] [2022-02-20 23:53:59,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604373085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:59,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:59,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:59,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534265412] [2022-02-20 23:53:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:59,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:53:59,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:59,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:59,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:59,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:59,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:59,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:59,787 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,038 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2022-02-20 23:54:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:54:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 23:54:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 23:54:00,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2022-02-20 23:54:00,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:00,213 INFO L225 Difference]: With dead ends: 177 [2022-02-20 23:54:00,213 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 23:54:00,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:00,220 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 134 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:00,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 112 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 23:54:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2022-02-20 23:54:00,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:00,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,229 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,230 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,233 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2022-02-20 23:54:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 183 transitions. [2022-02-20 23:54:00,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:00,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:00,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 177 states. [2022-02-20 23:54:00,235 INFO L87 Difference]: Start difference. First operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 177 states. [2022-02-20 23:54:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,239 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2022-02-20 23:54:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 183 transitions. [2022-02-20 23:54:00,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:00,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:00,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:00,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2022-02-20 23:54:00,245 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 7 [2022-02-20 23:54:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:00,245 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2022-02-20 23:54:00,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2022-02-20 23:54:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:54:00,246 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:00,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:00,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:54:00,247 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2022-02-20 23:54:00,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:00,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148392966] [2022-02-20 23:54:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:00,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {2959#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {2959#true} is VALID [2022-02-20 23:54:00,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {2959#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2959#true} is VALID [2022-02-20 23:54:00,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {2959#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {2959#true} is VALID [2022-02-20 23:54:00,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {2959#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {2959#true} is VALID [2022-02-20 23:54:00,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {2959#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {2959#true} is VALID [2022-02-20 23:54:00,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {2959#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {2961#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {2962#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {2962#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2962#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {2962#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:00,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {2962#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {2960#false} is VALID [2022-02-20 23:54:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:00,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:00,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148392966] [2022-02-20 23:54:00,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148392966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:00,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:00,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:00,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423907650] [2022-02-20 23:54:00,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:54:00,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:00,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:00,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:00,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:00,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:00,363 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,678 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:54:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:54:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:54:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:54:00,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2022-02-20 23:54:00,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:00,823 INFO L225 Difference]: With dead ends: 164 [2022-02-20 23:54:00,823 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 23:54:00,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:00,824 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 217 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:00,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 89 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 23:54:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2022-02-20 23:54:00,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:00,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,829 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,830 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,833 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:54:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2022-02-20 23:54:00,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:00,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:00,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:00,845 INFO L87 Difference]: Start difference. First operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:00,849 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:54:00,849 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2022-02-20 23:54:00,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:00,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:00,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:00,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2022-02-20 23:54:00,853 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 13 [2022-02-20 23:54:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:00,854 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2022-02-20 23:54:00,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2022-02-20 23:54:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:54:00,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:00,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:00,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:54:00,855 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2022-02-20 23:54:00,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:00,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231392147] [2022-02-20 23:54:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:00,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {3610#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {3610#true} is VALID [2022-02-20 23:54:00,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {3610#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3610#true} is VALID [2022-02-20 23:54:00,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3610#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {3610#true} is VALID [2022-02-20 23:54:00,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {3610#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {3610#true} is VALID [2022-02-20 23:54:00,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {3610#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {3610#true} is VALID [2022-02-20 23:54:00,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {3610#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:00,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:00,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:01,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:01,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {3612#(and (= 12 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {3613#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} is VALID [2022-02-20 23:54:01,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {3613#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {3613#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} is VALID [2022-02-20 23:54:01,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {3613#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {3613#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} is VALID [2022-02-20 23:54:01,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {3613#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {3611#false} is VALID [2022-02-20 23:54:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:01,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:01,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231392147] [2022-02-20 23:54:01,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231392147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:01,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:01,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:01,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613973141] [2022-02-20 23:54:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:01,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:54:01,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:01,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:01,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:01,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:01,017 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:01,444 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-02-20 23:54:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:54:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-02-20 23:54:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-02-20 23:54:01,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-02-20 23:54:01,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:01,593 INFO L225 Difference]: With dead ends: 193 [2022-02-20 23:54:01,593 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:54:01,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:01,594 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 187 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:01,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 133 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:54:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2022-02-20 23:54:01,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:01,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,599 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,600 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:01,604 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-02-20 23:54:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 203 transitions. [2022-02-20 23:54:01,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:01,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:01,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 23:54:01,606 INFO L87 Difference]: Start difference. First operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 23:54:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:01,610 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-02-20 23:54:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 203 transitions. [2022-02-20 23:54:01,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:01,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:01,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:01,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-02-20 23:54:01,615 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 13 [2022-02-20 23:54:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:01,615 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-02-20 23:54:01,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-02-20 23:54:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:54:01,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:01,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:01,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:54:01,617 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2022-02-20 23:54:01,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:01,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346188230] [2022-02-20 23:54:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:01,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {4358#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {4358#true} is VALID [2022-02-20 23:54:01,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {4358#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4358#true} is VALID [2022-02-20 23:54:01,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {4358#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {4360#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:01,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {4360#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {4360#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:01,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {4360#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {4360#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:01,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {4360#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:54:01,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {4361#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4362#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:01,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {4362#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {4359#false} is VALID [2022-02-20 23:54:01,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {4359#false} assume !false; {4359#false} is VALID [2022-02-20 23:54:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:01,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:01,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346188230] [2022-02-20 23:54:01,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346188230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:01,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:01,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:54:01,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879693471] [2022-02-20 23:54:01,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:54:01,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:01,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:01,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:01,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:01,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:01,698 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,172 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-02-20 23:54:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:54:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2022-02-20 23:54:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2022-02-20 23:54:02,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 216 transitions. [2022-02-20 23:54:02,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:02,330 INFO L225 Difference]: With dead ends: 202 [2022-02-20 23:54:02,330 INFO L226 Difference]: Without dead ends: 202 [2022-02-20 23:54:02,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:02,331 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 302 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:02,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 157 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-20 23:54:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2022-02-20 23:54:02,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:02,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,337 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,337 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,342 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-02-20 23:54:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 212 transitions. [2022-02-20 23:54:02,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:02,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:02,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 202 states. [2022-02-20 23:54:02,344 INFO L87 Difference]: Start difference. First operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 202 states. [2022-02-20 23:54:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,349 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-02-20 23:54:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 212 transitions. [2022-02-20 23:54:02,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:02,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:02,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:02,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2022-02-20 23:54:02,353 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 15 [2022-02-20 23:54:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:02,353 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2022-02-20 23:54:02,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2022-02-20 23:54:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:54:02,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:02,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:02,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:54:02,355 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2022-02-20 23:54:02,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:02,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611590274] [2022-02-20 23:54:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:02,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {5137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {5137#true} is VALID [2022-02-20 23:54:02,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {5137#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5137#true} is VALID [2022-02-20 23:54:02,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {5137#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {5137#true} is VALID [2022-02-20 23:54:02,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {5137#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {5137#true} is VALID [2022-02-20 23:54:02,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {5137#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {5137#true} is VALID [2022-02-20 23:54:02,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {5137#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {5137#true} is VALID [2022-02-20 23:54:02,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {5137#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {5137#true} is VALID [2022-02-20 23:54:02,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {5137#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {5137#true} is VALID [2022-02-20 23:54:02,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {5137#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {5137#true} is VALID [2022-02-20 23:54:02,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {5137#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {5137#true} is VALID [2022-02-20 23:54:02,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {5137#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {5137#true} is VALID [2022-02-20 23:54:02,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {5137#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {5139#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1)} is VALID [2022-02-20 23:54:02,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {5139#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {5140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {5140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:02,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {5140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {5141#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:54:02,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {5141#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} assume !(1 == #valid[main_#t~mem5#1.base]); {5138#false} is VALID [2022-02-20 23:54:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:02,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:02,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611590274] [2022-02-20 23:54:02,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611590274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:02,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:02,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:02,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038436886] [2022-02-20 23:54:02,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:02,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:54:02,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:02,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:02,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:02,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:02,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:02,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:02,430 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,803 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2022-02-20 23:54:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:54:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-02-20 23:54:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-02-20 23:54:02,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2022-02-20 23:54:02,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:02,906 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:54:02,906 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:54:02,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:02,907 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:02,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 352 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:54:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-02-20 23:54:02,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:02,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,911 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,911 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,914 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2022-02-20 23:54:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-02-20 23:54:02,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:02,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:02,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 23:54:02,916 INFO L87 Difference]: Start difference. First operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 23:54:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:02,918 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2022-02-20 23:54:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-02-20 23:54:02,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:02,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:02,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:02,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-02-20 23:54:02,922 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 16 [2022-02-20 23:54:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:02,923 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-02-20 23:54:02,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-02-20 23:54:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:54:02,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:02,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:02,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:54:02,924 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2022-02-20 23:54:02,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:02,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694011424] [2022-02-20 23:54:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:03,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {5792#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {5792#true} is VALID [2022-02-20 23:54:03,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {5792#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5792#true} is VALID [2022-02-20 23:54:03,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {5792#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {5792#true} is VALID [2022-02-20 23:54:03,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {5792#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {5792#true} is VALID [2022-02-20 23:54:03,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {5792#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {5792#true} is VALID [2022-02-20 23:54:03,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {5792#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {5792#true} is VALID [2022-02-20 23:54:03,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {5792#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {5792#true} is VALID [2022-02-20 23:54:03,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {5792#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {5792#true} is VALID [2022-02-20 23:54:03,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {5792#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {5792#true} is VALID [2022-02-20 23:54:03,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {5792#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {5792#true} is VALID [2022-02-20 23:54:03,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {5792#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {5792#true} is VALID [2022-02-20 23:54:03,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {5792#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {5794#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 12))} is VALID [2022-02-20 23:54:03,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {5795#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:03,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {5795#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5795#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:03,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {5795#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {5796#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:54:03,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {5796#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (- 12)) 0))} assume !(4 + (4 + main_#t~mem5#1.offset) <= #length[main_#t~mem5#1.base] && 0 <= 4 + main_#t~mem5#1.offset); {5793#false} is VALID [2022-02-20 23:54:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:03,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:03,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694011424] [2022-02-20 23:54:03,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694011424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:03,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:03,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:03,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537539861] [2022-02-20 23:54:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:54:03,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:03,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:03,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:03,048 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,498 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-02-20 23:54:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:54:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-02-20 23:54:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-02-20 23:54:03,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 138 transitions. [2022-02-20 23:54:03,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,598 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:54:03,598 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:54:03,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:03,598 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:03,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 343 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:54:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-02-20 23:54:03,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:03,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,602 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,602 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,605 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-02-20 23:54:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-02-20 23:54:03,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:03,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:03,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:54:03,606 INFO L87 Difference]: Start difference. First operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:54:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:03,608 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-02-20 23:54:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-02-20 23:54:03,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:03,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:03,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:03,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-02-20 23:54:03,612 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 16 [2022-02-20 23:54:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:03,612 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-02-20 23:54:03,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-02-20 23:54:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:54:03,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:03,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:03,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:54:03,613 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:03,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2022-02-20 23:54:03,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:03,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141679492] [2022-02-20 23:54:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:03,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {6443#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {6443#true} is VALID [2022-02-20 23:54:03,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {6443#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:03,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:03,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:03,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:03,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {6445#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {6446#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {6446#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {6446#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {6446#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {6446#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {6446#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:03,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {6447#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {6448#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~null~0#1.offset| 8) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:54:03,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {6448#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~null~0#1.offset| 8) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {6449#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:03,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {6449#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {6449#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:03,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {6449#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {6450#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem13#1|)} is VALID [2022-02-20 23:54:03,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {6450#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem13#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {6444#false} is VALID [2022-02-20 23:54:03,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {6444#false} assume !false; {6444#false} is VALID [2022-02-20 23:54:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:03,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:03,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141679492] [2022-02-20 23:54:03,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141679492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:03,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:03,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:03,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84640541] [2022-02-20 23:54:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:03,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:54:03,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:03,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:03,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:03,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:54:03,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:54:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:03,778 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,532 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-02-20 23:54:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:54:04,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:54:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2022-02-20 23:54:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2022-02-20 23:54:04,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 213 transitions. [2022-02-20 23:54:04,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:04,691 INFO L225 Difference]: With dead ends: 214 [2022-02-20 23:54:04,691 INFO L226 Difference]: Without dead ends: 214 [2022-02-20 23:54:04,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:54:04,692 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 333 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:04,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-20 23:54:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2022-02-20 23:54:04,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:04,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,696 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,696 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,700 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-02-20 23:54:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2022-02-20 23:54:04,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:04,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:04,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-20 23:54:04,701 INFO L87 Difference]: Start difference. First operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2022-02-20 23:54:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:04,705 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-02-20 23:54:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2022-02-20 23:54:04,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:04,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:04,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:04,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2022-02-20 23:54:04,709 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 18 [2022-02-20 23:54:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:04,709 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2022-02-20 23:54:04,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2022-02-20 23:54:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:54:04,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:04,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:04,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:54:04,710 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2022-02-20 23:54:04,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:04,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067764098] [2022-02-20 23:54:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:04,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:04,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {7268#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {7268#true} is VALID [2022-02-20 23:54:04,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {7268#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {7268#true} is VALID [2022-02-20 23:54:04,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {7268#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {7268#true} is VALID [2022-02-20 23:54:04,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {7268#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {7268#true} is VALID [2022-02-20 23:54:04,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {7268#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {7268#true} is VALID [2022-02-20 23:54:04,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {7268#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {7268#true} is VALID [2022-02-20 23:54:04,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {7268#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {7270#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:04,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {7270#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {7270#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:04,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {7270#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {7270#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:04,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {7270#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7271#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:04,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {7271#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7271#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:04,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {7271#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {7272#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1))} is VALID [2022-02-20 23:54:04,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {7272#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {7273#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:04,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {7273#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7273#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:04,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {7273#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {7274#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:04,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {7274#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {7275#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:04,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {7275#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7275#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:04,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {7275#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {7276#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:54:04,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {7276#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7271#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:04,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {7271#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {7269#false} is VALID [2022-02-20 23:54:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:04,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:04,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067764098] [2022-02-20 23:54:04,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067764098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:04,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:04,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:04,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480868908] [2022-02-20 23:54:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:04,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:54:04,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:04,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:04,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:04,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:04,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:04,852 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,633 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-02-20 23:54:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:54:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-02-20 23:54:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2022-02-20 23:54:05,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 141 transitions. [2022-02-20 23:54:05,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:05,747 INFO L225 Difference]: With dead ends: 164 [2022-02-20 23:54:05,747 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 23:54:05,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:54:05,748 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 183 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:05,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 282 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 23:54:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-02-20 23:54:05,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:05,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,752 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,752 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,755 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-02-20 23:54:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-02-20 23:54:05,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:05,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:05,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:05,756 INFO L87 Difference]: Start difference. First operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:05,759 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-02-20 23:54:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-02-20 23:54:05,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:05,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:05,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:05,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2022-02-20 23:54:05,762 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 20 [2022-02-20 23:54:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:05,763 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2022-02-20 23:54:05,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-02-20 23:54:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:54:05,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:05,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:05,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:54:05,764 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2022-02-20 23:54:05,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:05,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955932484] [2022-02-20 23:54:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:05,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {7947#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {7947#true} is VALID [2022-02-20 23:54:05,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {7947#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {7947#true} is VALID [2022-02-20 23:54:05,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {7947#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {7947#true} is VALID [2022-02-20 23:54:05,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {7947#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {7947#true} is VALID [2022-02-20 23:54:05,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {7947#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {7947#true} is VALID [2022-02-20 23:54:05,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {7947#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {7947#true} is VALID [2022-02-20 23:54:05,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {7947#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {7949#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:05,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {7949#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {7949#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:05,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {7949#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {7949#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:54:05,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {7949#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7950#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:05,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {7950#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7950#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:05,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {7950#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {7951#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 12))} is VALID [2022-02-20 23:54:05,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {7951#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {7952#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:05,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {7952#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7952#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:05,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {7952#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {7953#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:05,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {7953#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {7954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:05,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {7954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:05,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {7954#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {7955#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) 12))} is VALID [2022-02-20 23:54:05,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {7955#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) 12))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7956#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} is VALID [2022-02-20 23:54:05,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {7956#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {7948#false} is VALID [2022-02-20 23:54:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:05,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:05,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955932484] [2022-02-20 23:54:05,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955932484] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:05,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:05,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:54:05,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072353434] [2022-02-20 23:54:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:05,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:54:05,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:05,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:05,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:05,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:54:05,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:54:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:54:05,979 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,094 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2022-02-20 23:54:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:54:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:54:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 170 transitions. [2022-02-20 23:54:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 170 transitions. [2022-02-20 23:54:07,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 170 transitions. [2022-02-20 23:54:07,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:07,217 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:54:07,218 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:54:07,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:54:07,218 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 237 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:07,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 297 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:54:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:54:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2022-02-20 23:54:07,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:07,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,221 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,222 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,224 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2022-02-20 23:54:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2022-02-20 23:54:07,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:07,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:07,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states. [2022-02-20 23:54:07,225 INFO L87 Difference]: Start difference. First operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states. [2022-02-20 23:54:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:07,228 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2022-02-20 23:54:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2022-02-20 23:54:07,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:07,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:07,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:07,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-02-20 23:54:07,231 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 20 [2022-02-20 23:54:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:07,231 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-02-20 23:54:07,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-02-20 23:54:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:54:07,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:07,232 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:07,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:54:07,232 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2022-02-20 23:54:07,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:07,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808064176] [2022-02-20 23:54:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:07,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {8699#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {8699#true} is VALID [2022-02-20 23:54:07,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8699#true} is VALID [2022-02-20 23:54:07,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {8699#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {8699#true} is VALID [2022-02-20 23:54:07,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {8699#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {8699#true} is VALID [2022-02-20 23:54:07,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {8699#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {8699#true} is VALID [2022-02-20 23:54:07,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {8699#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {8699#true} is VALID [2022-02-20 23:54:07,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {8699#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:07,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:07,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:07,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:07,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:07,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:07,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:07,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {8703#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem17#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem17#1.base|))} is VALID [2022-02-20 23:54:07,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {8703#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem17#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem17#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {8704#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:07,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {8704#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8700#false} is VALID [2022-02-20 23:54:07,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {8700#false} assume !(1 == #valid[main_~end~0#1.base]); {8700#false} is VALID [2022-02-20 23:54:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:07,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:07,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808064176] [2022-02-20 23:54:07,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808064176] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:07,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418245328] [2022-02-20 23:54:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:07,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:07,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:54:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:07,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:54:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:07,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:07,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:07,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:07,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:07,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:07,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:07,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:07,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:07,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:07,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:07,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:08,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:08,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:08,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {8699#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {8699#true} is VALID [2022-02-20 23:54:08,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:08,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:08,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:08,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:08,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {8711#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {8724#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:54:08,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {8724#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {8728#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {8747#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {8775#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem17#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem17#1.base|))} is VALID [2022-02-20 23:54:08,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {8775#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem17#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem17#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {8779#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} is VALID [2022-02-20 23:54:08,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {8779#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8700#false} is VALID [2022-02-20 23:54:08,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {8700#false} assume !(1 == #valid[main_~end~0#1.base]); {8700#false} is VALID [2022-02-20 23:54:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:08,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:08,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {8700#false} assume !(1 == #valid[main_~end~0#1.base]); {8700#false} is VALID [2022-02-20 23:54:08,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {8704#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8700#false} is VALID [2022-02-20 23:54:08,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {8703#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem17#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem17#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {8704#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:08,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {8703#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem17#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem17#1.base|))} is VALID [2022-02-20 23:54:08,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:08,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {8699#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {8701#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:08,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {8699#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {8699#true} is VALID [2022-02-20 23:54:08,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {8699#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {8699#true} is VALID [2022-02-20 23:54:08,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {8699#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {8699#true} is VALID [2022-02-20 23:54:08,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {8699#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {8699#true} is VALID [2022-02-20 23:54:08,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8699#true} is VALID [2022-02-20 23:54:08,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {8699#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {8699#true} is VALID [2022-02-20 23:54:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:08,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418245328] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:08,342 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:08,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-02-20 23:54:08,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8151139] [2022-02-20 23:54:08,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:08,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:08,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:08,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:08,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:54:08,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:54:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:54:08,383 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:09,814 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2022-02-20 23:54:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:54:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2022-02-20 23:54:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2022-02-20 23:54:09,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 204 transitions. [2022-02-20 23:54:10,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,012 INFO L225 Difference]: With dead ends: 219 [2022-02-20 23:54:10,012 INFO L226 Difference]: Without dead ends: 219 [2022-02-20 23:54:10,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:54:10,013 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 235 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:10,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 515 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:54:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-20 23:54:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 175. [2022-02-20 23:54:10,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:10,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,016 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,016 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,022 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2022-02-20 23:54:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2022-02-20 23:54:10,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 219 states. [2022-02-20 23:54:10,024 INFO L87 Difference]: Start difference. First operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 219 states. [2022-02-20 23:54:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,028 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2022-02-20 23:54:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2022-02-20 23:54:10,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:10,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2022-02-20 23:54:10,032 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 25 [2022-02-20 23:54:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:10,032 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2022-02-20 23:54:10,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2022-02-20 23:54:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:54:10,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:10,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:10,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:10,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 23:54:10,248 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2022-02-20 23:54:10,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:10,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290282365] [2022-02-20 23:54:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:10,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {9701#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {9701#true} is VALID [2022-02-20 23:54:10,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {9701#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {9701#true} is VALID [2022-02-20 23:54:10,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {9701#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {9701#true} is VALID [2022-02-20 23:54:10,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {9701#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {9701#true} is VALID [2022-02-20 23:54:10,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {9701#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {9701#true} is VALID [2022-02-20 23:54:10,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {9701#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {9701#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {9701#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {9701#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {9701#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {9701#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {9701#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {9701#true} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {9701#true} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9701#true} is VALID [2022-02-20 23:54:10,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {9701#true} goto; {9701#true} is VALID [2022-02-20 23:54:10,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {9701#true} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {9703#(= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|)} is VALID [2022-02-20 23:54:10,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {9703#(= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|)} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {9704#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:10,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {9704#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {9704#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:10,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {9704#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9704#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:10,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {9704#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {9705#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem14#1|)} is VALID [2022-02-20 23:54:10,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {9705#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem14#1|)} assume ~unnamed1~0~RED == main_#t~mem14#1;havoc main_#t~mem14#1; {9702#false} is VALID [2022-02-20 23:54:10,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {9702#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1055 {9702#false} is VALID [2022-02-20 23:54:10,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {9702#false} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {9702#false} is VALID [2022-02-20 23:54:10,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {9702#false} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9702#false} is VALID [2022-02-20 23:54:10,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {9702#false} assume !false; {9702#false} is VALID [2022-02-20 23:54:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:10,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:10,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290282365] [2022-02-20 23:54:10,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290282365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:10,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:10,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:54:10,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903656496] [2022-02-20 23:54:10,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:10,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:10,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:10,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:10,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:10,367 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,772 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2022-02-20 23:54:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:10,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:54:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-02-20 23:54:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-02-20 23:54:10,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 144 transitions. [2022-02-20 23:54:10,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:10,903 INFO L225 Difference]: With dead ends: 179 [2022-02-20 23:54:10,903 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 23:54:10,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:54:10,904 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 25 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:10,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 354 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 23:54:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2022-02-20 23:54:10,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:10,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,912 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,912 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,915 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2022-02-20 23:54:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2022-02-20 23:54:10,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 179 states. [2022-02-20 23:54:10,916 INFO L87 Difference]: Start difference. First operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 179 states. [2022-02-20 23:54:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:10,919 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2022-02-20 23:54:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2022-02-20 23:54:10,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:10,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:10,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:10,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2022-02-20 23:54:10,923 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 25 [2022-02-20 23:54:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:10,924 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2022-02-20 23:54:10,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2022-02-20 23:54:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:54:10,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:10,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:10,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:54:10,926 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2022-02-20 23:54:10,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:10,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946137715] [2022-02-20 23:54:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:11,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {10421#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {10421#true} is VALID [2022-02-20 23:54:11,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {10421#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {10421#true} is VALID [2022-02-20 23:54:11,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {10421#true} is VALID [2022-02-20 23:54:11,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {10421#true} is VALID [2022-02-20 23:54:11,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {10421#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {10421#true} is VALID [2022-02-20 23:54:11,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {10421#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {10421#true} is VALID [2022-02-20 23:54:11,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {10421#true} is VALID [2022-02-20 23:54:11,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {10421#true} is VALID [2022-02-20 23:54:11,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {10421#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {10421#true} is VALID [2022-02-20 23:54:11,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {10421#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {10421#true} is VALID [2022-02-20 23:54:11,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {10421#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {10421#true} is VALID [2022-02-20 23:54:11,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {10421#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {10421#true} is VALID [2022-02-20 23:54:11,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {10421#true} is VALID [2022-02-20 23:54:11,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {10421#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {10421#true} is VALID [2022-02-20 23:54:11,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {10421#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {10421#true} is VALID [2022-02-20 23:54:11,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {10421#true} is VALID [2022-02-20 23:54:11,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {10421#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {10421#true} is VALID [2022-02-20 23:54:11,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {10421#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {10421#true} is VALID [2022-02-20 23:54:11,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {10421#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {10421#true} is VALID [2022-02-20 23:54:11,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {10421#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {10421#true} is VALID [2022-02-20 23:54:11,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {10421#true} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {10421#true} is VALID [2022-02-20 23:54:11,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {10421#true} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1; {10421#true} is VALID [2022-02-20 23:54:11,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {10421#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1029 {10423#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:11,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {10423#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem11#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1040-4 {10424#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem11#1|)} is VALID [2022-02-20 23:54:11,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {10424#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem11#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem11#1);havoc main_#t~mem11#1; {10422#false} is VALID [2022-02-20 23:54:11,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {10422#false} assume !false; {10422#false} is VALID [2022-02-20 23:54:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:11,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:11,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946137715] [2022-02-20 23:54:11,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946137715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:11,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:11,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:11,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550600554] [2022-02-20 23:54:11,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:54:11,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:11,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:11,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:11,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:11,073 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,335 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2022-02-20 23:54:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:54:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-02-20 23:54:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2022-02-20 23:54:11,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 137 transitions. [2022-02-20 23:54:11,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:11,440 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:54:11,440 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:54:11,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:11,441 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 20 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:11,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 300 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:54:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2022-02-20 23:54:11,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:11,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,444 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,444 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,447 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2022-02-20 23:54:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2022-02-20 23:54:11,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:11,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:11,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 176 states. [2022-02-20 23:54:11,448 INFO L87 Difference]: Start difference. First operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 176 states. [2022-02-20 23:54:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,450 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2022-02-20 23:54:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2022-02-20 23:54:11,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:11,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:11,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:11,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2022-02-20 23:54:11,453 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 26 [2022-02-20 23:54:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:11,454 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2022-02-20 23:54:11,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2022-02-20 23:54:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:54:11,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:11,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:11,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:54:11,455 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2022-02-20 23:54:11,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:11,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485641578] [2022-02-20 23:54:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {11129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {11129#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {11129#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {11129#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {11129#true} is VALID [2022-02-20 23:54:11,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {11129#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {11129#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {11129#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {11129#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {11129#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {11129#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {11129#true} is VALID [2022-02-20 23:54:11,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {11129#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {11129#true} is VALID [2022-02-20 23:54:11,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {11129#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {11129#true} is VALID [2022-02-20 23:54:11,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {11129#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {11129#true} is VALID [2022-02-20 23:54:11,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {11129#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {11129#true} is VALID [2022-02-20 23:54:11,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {11129#true} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {11129#true} is VALID [2022-02-20 23:54:11,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {11129#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {11129#true} is VALID [2022-02-20 23:54:11,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {11129#true} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1033 {11129#true} is VALID [2022-02-20 23:54:11,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {11129#true} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(12); {11131#(= (select |#valid| |ULTIMATE.start_main_#t~malloc8#1.base|) 1)} is VALID [2022-02-20 23:54:11,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {11131#(= (select |#valid| |ULTIMATE.start_main_#t~malloc8#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1034 {11132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:11,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {11132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {11132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:11,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {11132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1035 {11133#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:54:11,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {11133#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} assume !(1 == #valid[main_#t~mem9#1.base]); {11130#false} is VALID [2022-02-20 23:54:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:11,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:11,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485641578] [2022-02-20 23:54:11,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485641578] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:11,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:11,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:11,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135250115] [2022-02-20 23:54:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:54:11,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:11,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:11,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:11,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:11,543 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,895 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2022-02-20 23:54:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:54:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-02-20 23:54:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-02-20 23:54:11,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 128 transitions. [2022-02-20 23:54:11,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:11,985 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:54:11,986 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:54:11,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:11,986 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:11,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 327 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:54:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-02-20 23:54:11,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:11,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,990 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,991 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,993 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2022-02-20 23:54:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-02-20 23:54:11,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:11,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:11,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 171 states. [2022-02-20 23:54:11,994 INFO L87 Difference]: Start difference. First operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 171 states. [2022-02-20 23:54:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:11,997 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2022-02-20 23:54:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-02-20 23:54:11,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:11,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:11,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:11,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2022-02-20 23:54:12,000 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 28 [2022-02-20 23:54:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:12,001 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2022-02-20 23:54:12,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-02-20 23:54:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:54:12,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:12,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:12,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:54:12,016 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2022-02-20 23:54:12,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:12,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610062500] [2022-02-20 23:54:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:12,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {11824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {11824#true} is VALID [2022-02-20 23:54:12,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {11824#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {11824#true} is VALID [2022-02-20 23:54:12,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {11824#true} is VALID [2022-02-20 23:54:12,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {11824#true} is VALID [2022-02-20 23:54:12,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {11824#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {11824#true} is VALID [2022-02-20 23:54:12,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {11824#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {11824#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {11824#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {11824#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {11824#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {11824#true} is VALID [2022-02-20 23:54:12,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {11824#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {11824#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {11824#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {11824#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {11824#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {11824#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {11824#true} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {11824#true} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {11824#true} is VALID [2022-02-20 23:54:12,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {11824#true} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1033 {11824#true} is VALID [2022-02-20 23:54:12,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {11824#true} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(12); {11826#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 12))} is VALID [2022-02-20 23:54:12,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {11826#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1034 {11827#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:12,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {11827#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {11827#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:12,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {11827#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1035 {11828#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) 0))} is VALID [2022-02-20 23:54:12,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {11828#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) 0))} assume !(4 + (4 + main_#t~mem9#1.offset) <= #length[main_#t~mem9#1.base] && 0 <= 4 + main_#t~mem9#1.offset); {11825#false} is VALID [2022-02-20 23:54:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:12,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:12,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610062500] [2022-02-20 23:54:12,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610062500] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:12,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:12,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:12,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414940361] [2022-02-20 23:54:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:12,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:54:12,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:12,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:12,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:12,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:12,139 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:12,530 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-02-20 23:54:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:54:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-02-20 23:54:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-02-20 23:54:12,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 127 transitions. [2022-02-20 23:54:12,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:12,639 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:54:12,640 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:54:12,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:12,641 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:12,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:54:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-02-20 23:54:12,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:12,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,644 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,644 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:12,646 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-02-20 23:54:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2022-02-20 23:54:12,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:12,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:12,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 170 states. [2022-02-20 23:54:12,647 INFO L87 Difference]: Start difference. First operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 170 states. [2022-02-20 23:54:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:12,650 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-02-20 23:54:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2022-02-20 23:54:12,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:12,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:12,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:12,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2022-02-20 23:54:12,653 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 28 [2022-02-20 23:54:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:12,653 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2022-02-20 23:54:12,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2022-02-20 23:54:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:54:12,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:12,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:12,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:54:12,654 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2022-02-20 23:54:12,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:12,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522672646] [2022-02-20 23:54:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:12,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {12515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {12515#true} is VALID [2022-02-20 23:54:12,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {12515#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {12515#true} is VALID [2022-02-20 23:54:12,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {12515#true} is VALID [2022-02-20 23:54:12,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {12515#true} is VALID [2022-02-20 23:54:12,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {12515#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {12515#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {12515#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {12515#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {12515#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {12515#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {12515#true} is VALID [2022-02-20 23:54:12,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {12515#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12515#true} is VALID [2022-02-20 23:54:12,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {12515#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {12515#true} is VALID [2022-02-20 23:54:12,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {12515#true} is VALID [2022-02-20 23:54:12,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {12515#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12515#true} is VALID [2022-02-20 23:54:12,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {12515#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {12515#true} is VALID [2022-02-20 23:54:12,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {12515#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {12515#true} is VALID [2022-02-20 23:54:12,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {12515#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1; {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1029 {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem11#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1040-4 {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem11#1);havoc main_#t~mem11#1; {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:12,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {12517#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1041-4 {12518#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem12#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem12#1.base|))} is VALID [2022-02-20 23:54:12,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {12518#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem12#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem12#1.base|))} assume !(main_~null~0#1.base == main_#t~mem12#1.base && main_~null~0#1.offset == main_#t~mem12#1.offset);havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {12516#false} is VALID [2022-02-20 23:54:12,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {12516#false} assume !false; {12516#false} is VALID [2022-02-20 23:54:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:12,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:12,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522672646] [2022-02-20 23:54:12,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522672646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:12,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:12,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:12,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001887919] [2022-02-20 23:54:12,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:12,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:54:12,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:12,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:12,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:12,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:12,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:12,785 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:13,093 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-02-20 23:54:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:54:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-02-20 23:54:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-02-20 23:54:13,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2022-02-20 23:54:13,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:13,206 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:54:13,207 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:54:13,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:13,207 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:13,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 250 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:54:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-02-20 23:54:13,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:13,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,211 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,211 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:13,213 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-02-20 23:54:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-02-20 23:54:13,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:13,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:13,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:54:13,214 INFO L87 Difference]: Start difference. First operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:54:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:13,216 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-02-20 23:54:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-02-20 23:54:13,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:13,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:13,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:13,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2022-02-20 23:54:13,219 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 29 [2022-02-20 23:54:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:13,220 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2022-02-20 23:54:13,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2022-02-20 23:54:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:54:13,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:13,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:13,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:54:13,221 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2022-02-20 23:54:13,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:13,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619325097] [2022-02-20 23:54:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:13,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {13198#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {13198#true} is VALID [2022-02-20 23:54:13,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {13198#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:13,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:13,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:13,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:54:13,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {13200#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {13201#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} is VALID [2022-02-20 23:54:13,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {13201#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {13202#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} is VALID [2022-02-20 23:54:13,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {13202#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {13202#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} is VALID [2022-02-20 23:54:13,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {13202#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {13202#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} is VALID [2022-02-20 23:54:13,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {13202#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {13203#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} is VALID [2022-02-20 23:54:13,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {13203#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13203#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} is VALID [2022-02-20 23:54:13,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {13203#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {13204#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)))} is VALID [2022-02-20 23:54:13,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {13204#(and (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {13205#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:54:13,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {13205#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {13205#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:54:13,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {13205#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {13206#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:54:13,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {13206#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {13207#(not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:13,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {13207#(not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {13207#(not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:13,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {13207#(not (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {13208#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem6#1.base|))} is VALID [2022-02-20 23:54:13,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {13208#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem6#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} assume 0 != main_#t~nondet7#1;havoc main_#t~nondet7#1; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1029 {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} SUMMARY for call main_#t~mem11#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1040-4 {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} assume !!(~unnamed1~0~BLACK == main_#t~mem11#1);havoc main_#t~mem11#1; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} goto; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1041-4 {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} assume !!(main_~null~0#1.base == main_#t~mem12#1.base && main_~null~0#1.offset == main_#t~mem12#1.offset);havoc main_#t~mem12#1.base, main_#t~mem12#1.offset; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} goto; {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:13,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {13209#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {13199#false} is VALID [2022-02-20 23:54:13,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {13199#false} assume !false; {13199#false} is VALID [2022-02-20 23:54:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:13,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:13,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619325097] [2022-02-20 23:54:13,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619325097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:13,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:13,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:54:13,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022008485] [2022-02-20 23:54:13,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:54:13,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:13,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:13,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:13,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:54:13,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:54:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:54:13,489 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:14,708 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2022-02-20 23:54:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 23:54:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:54:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 201 transitions. [2022-02-20 23:54:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 201 transitions. [2022-02-20 23:54:14,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 201 transitions. [2022-02-20 23:54:14,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:14,860 INFO L225 Difference]: With dead ends: 205 [2022-02-20 23:54:14,860 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 23:54:14,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:54:14,861 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 481 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:14,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 299 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:54:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 23:54:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2022-02-20 23:54:14,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:14,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,864 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,864 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:14,867 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2022-02-20 23:54:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 215 transitions. [2022-02-20 23:54:14,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:14,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:14,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 205 states. [2022-02-20 23:54:14,868 INFO L87 Difference]: Start difference. First operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 205 states. [2022-02-20 23:54:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:14,871 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2022-02-20 23:54:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 215 transitions. [2022-02-20 23:54:14,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:14,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:14,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:14,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2022-02-20 23:54:14,874 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 31 [2022-02-20 23:54:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:14,874 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2022-02-20 23:54:14,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2022-02-20 23:54:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:54:14,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:14,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:14,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:54:14,875 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2022-02-20 23:54:14,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:14,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448255388] [2022-02-20 23:54:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:14,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {14025#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {14025#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {14025#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {14025#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {14025#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {14025#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {14025#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {14025#true} is VALID [2022-02-20 23:54:14,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {14025#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {14025#true} is VALID [2022-02-20 23:54:14,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {14025#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:14,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {14027#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {14028#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} is VALID [2022-02-20 23:54:14,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {14028#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {14029#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:14,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {14029#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {14029#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:14,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {14029#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {14029#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:14,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {14029#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {14030#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem14#1|)} is VALID [2022-02-20 23:54:14,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {14030#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem14#1|)} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:14,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:14,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:14,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:14,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:14,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {14031#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {14032#(not (= ~unnamed1~0~RED |ULTIMATE.start_main_#t~mem18#1|))} is VALID [2022-02-20 23:54:14,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {14032#(not (= ~unnamed1~0~RED |ULTIMATE.start_main_#t~mem18#1|))} assume ~unnamed1~0~RED == main_#t~mem18#1;havoc main_#t~mem18#1; {14026#false} is VALID [2022-02-20 23:54:14,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {14026#false} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {14026#false} is VALID [2022-02-20 23:54:14,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {14026#false} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset; {14026#false} is VALID [2022-02-20 23:54:14,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {14026#false} assume 0 == main_~list~0#1.offset; {14026#false} is VALID [2022-02-20 23:54:14,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {14026#false} assume !(main_~list~0#1.base < #StackHeapBarrier); {14026#false} is VALID [2022-02-20 23:54:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:14,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:14,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448255388] [2022-02-20 23:54:14,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448255388] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:14,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861188299] [2022-02-20 23:54:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:14,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:15,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:54:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:15,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:54:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:15,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:15,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {14025#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {14025#true} is VALID [2022-02-20 23:54:15,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {14025#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {14025#true} is VALID [2022-02-20 23:54:15,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {14025#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {14025#true} is VALID [2022-02-20 23:54:15,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {14025#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {14025#true} is VALID [2022-02-20 23:54:15,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {14025#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {14025#true} is VALID [2022-02-20 23:54:15,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {14025#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} goto; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} goto; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume ~unnamed1~0~RED == main_#t~mem18#1;havoc main_#t~mem18#1; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume 0 == main_~list~0#1.offset; {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:54:15,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {14051#(< |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(main_~list~0#1.base < #StackHeapBarrier); {14026#false} is VALID [2022-02-20 23:54:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:54:15,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:15,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861188299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:15,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:54:15,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-02-20 23:54:15,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83006274] [2022-02-20 23:54:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:15,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:54:15,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:15,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:15,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:15,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:15,279 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:15,404 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-02-20 23:54:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 23:54:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 23:54:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 23:54:15,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 23:54:15,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:15,502 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:54:15,502 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:54:15,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:15,503 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 72 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:15,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 127 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:54:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:54:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-02-20 23:54:15,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:15,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,506 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,506 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:15,508 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-02-20 23:54:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-02-20 23:54:15,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:15,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:15,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:54:15,509 INFO L87 Difference]: Start difference. First operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:54:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:15,511 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-02-20 23:54:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-02-20 23:54:15,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:15,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:15,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:15,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2022-02-20 23:54:15,514 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 31 [2022-02-20 23:54:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:15,515 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2022-02-20 23:54:15,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-02-20 23:54:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:54:15,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:15,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:15,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 23:54:15,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-02-20 23:54:15,731 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2022-02-20 23:54:15,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:15,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785892840] [2022-02-20 23:54:15,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:15,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {14802#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {14802#true} is VALID [2022-02-20 23:54:15,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {14802#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {14802#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {14802#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {14802#true} is VALID [2022-02-20 23:54:15,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {14802#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {14802#true} is VALID [2022-02-20 23:54:15,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {14802#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14802#true} is VALID [2022-02-20 23:54:15,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {14802#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {14802#true} is VALID [2022-02-20 23:54:15,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {14802#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {14802#true} is VALID [2022-02-20 23:54:15,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {14802#true} is VALID [2022-02-20 23:54:15,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {14802#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {14802#true} is VALID [2022-02-20 23:54:15,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {14802#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {14802#true} is VALID [2022-02-20 23:54:15,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {14802#true} is VALID [2022-02-20 23:54:15,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {14802#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {14802#true} is VALID [2022-02-20 23:54:15,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {14802#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {14802#true} is VALID [2022-02-20 23:54:15,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {14802#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {14802#true} is VALID [2022-02-20 23:54:15,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {14802#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1033 {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(12); {14805#(and (not (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc8#1.base|) 1))} is VALID [2022-02-20 23:54:15,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {14805#(and (not (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc8#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1034 {14806#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {14806#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {14806#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {14806#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1035 {14807#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem9#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:15,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {14807#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem9#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem9#1.base, 4 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {14808#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:15,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {14808#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {14808#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:15,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {14808#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1036 {14809#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) 1)} is VALID [2022-02-20 23:54:15,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {14809#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:15,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {14804#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {14803#false} is VALID [2022-02-20 23:54:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:15,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:15,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785892840] [2022-02-20 23:54:15,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785892840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:15,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:15,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:54:15,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481779060] [2022-02-20 23:54:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:54:15,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:15,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:15,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:15,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:54:15,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:54:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:15,903 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:16,577 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-02-20 23:54:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:54:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:54:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-02-20 23:54:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-02-20 23:54:16,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-02-20 23:54:16,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:16,664 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:54:16,664 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:54:16,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:54:16,665 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:16,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 327 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:54:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-02-20 23:54:16,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:16,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,668 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,668 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:16,670 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-02-20 23:54:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-02-20 23:54:16,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:16,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:16,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:54:16,672 INFO L87 Difference]: Start difference. First operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:54:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:16,674 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-02-20 23:54:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-02-20 23:54:16,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:16,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:16,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:16,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2022-02-20 23:54:16,677 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 32 [2022-02-20 23:54:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:16,677 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2022-02-20 23:54:16,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2022-02-20 23:54:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:54:16,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:16,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:16,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:54:16,678 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2022-02-20 23:54:16,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:16,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42382441] [2022-02-20 23:54:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:16,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {15497#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {15497#true} is VALID [2022-02-20 23:54:16,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {15497#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {15497#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {15497#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {15497#true} is VALID [2022-02-20 23:54:16,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {15497#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {15497#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {15497#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {15497#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12); {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1022 {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {15497#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {15497#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1023 {15497#true} is VALID [2022-02-20 23:54:16,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, 4 + main_#t~mem5#1.offset, 4); srcloc: L1023-1 {15497#true} is VALID [2022-02-20 23:54:16,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {15497#true} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {15497#true} is VALID [2022-02-20 23:54:16,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {15497#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1024 {15497#true} is VALID [2022-02-20 23:54:16,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {15497#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {15497#true} is VALID [2022-02-20 23:54:16,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {15497#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1025 {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647; {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(0 != main_#t~nondet7#1);havoc main_#t~nondet7#1; {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1033 {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:54:16,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {15499#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(12); {15500#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 12) (not (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~end~0#1.base|)))} is VALID [2022-02-20 23:54:16,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {15500#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc8#1.base|) 12) (not (= |ULTIMATE.start_main_#t~malloc8#1.base| |ULTIMATE.start_main_~end~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1034 {15501#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:16,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {15501#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {15501#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:16,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {15501#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1035 {15502#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem9#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:16,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {15502#(and (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem9#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem9#1.base, 4 + main_#t~mem9#1.offset, 4); srcloc: L1035-1 {15503#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:16,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {15503#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {15503#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} is VALID [2022-02-20 23:54:16,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {15503#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 12))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1036 {15504#(and (= (select |#length| |ULTIMATE.start_main_#t~mem10#1.base|) 12) (= |ULTIMATE.start_main_#t~mem10#1.offset| 0))} is VALID [2022-02-20 23:54:16,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {15504#(and (= (select |#length| |ULTIMATE.start_main_#t~mem10#1.base|) 12) (= |ULTIMATE.start_main_#t~mem10#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {15505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} is VALID [2022-02-20 23:54:16,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {15505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 12))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {15498#false} is VALID [2022-02-20 23:54:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:16,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:16,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42382441] [2022-02-20 23:54:16,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42382441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:16,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:16,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:16,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707962671] [2022-02-20 23:54:16,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:54:16,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:16,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:16,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:16,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:16,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:16,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:16,845 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:17,671 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:54:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:54:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-02-20 23:54:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-02-20 23:54:17,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 149 transitions. [2022-02-20 23:54:17,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:17,774 INFO L225 Difference]: With dead ends: 164 [2022-02-20 23:54:17,774 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 23:54:17,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:54:17,774 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 71 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:17,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 435 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 23:54:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2022-02-20 23:54:17,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:17,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,777 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,778 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:17,780 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:54:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2022-02-20 23:54:17,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:17,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:17,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:17,781 INFO L87 Difference]: Start difference. First operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:17,783 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:54:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2022-02-20 23:54:17,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:17,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:17,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:17,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2022-02-20 23:54:17,785 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 32 [2022-02-20 23:54:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:17,786 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2022-02-20 23:54:17,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2022-02-20 23:54:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:54:17,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:17,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:17,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:54:17,787 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2022-02-20 23:54:17,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:17,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583487923] [2022-02-20 23:54:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:17,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:17,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {16165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {16165#true} is VALID [2022-02-20 23:54:17,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {16165#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {16165#true} is VALID [2022-02-20 23:54:17,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {16165#true} is VALID [2022-02-20 23:54:17,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {16165#true} is VALID [2022-02-20 23:54:17,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {16165#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {16165#true} is VALID [2022-02-20 23:54:17,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {16165#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {16165#true} is VALID [2022-02-20 23:54:17,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {16165#true} is VALID [2022-02-20 23:54:17,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {16165#true} is VALID [2022-02-20 23:54:17,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {16165#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:17,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {16168#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} is VALID [2022-02-20 23:54:17,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {16168#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem13#1|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {16169#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:17,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {16169#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {16169#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:17,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {16169#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16169#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:17,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {16169#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {16170#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem14#1|)} is VALID [2022-02-20 23:54:17,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {16170#(= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) |ULTIMATE.start_main_#t~mem14#1|)} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:17,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:17,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:17,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:17,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:54:17,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {16171#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {16172#(not (= ~unnamed1~0~RED |ULTIMATE.start_main_#t~mem18#1|))} is VALID [2022-02-20 23:54:17,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {16172#(not (= ~unnamed1~0~RED |ULTIMATE.start_main_#t~mem18#1|))} assume ~unnamed1~0~RED == main_#t~mem18#1;havoc main_#t~mem18#1; {16166#false} is VALID [2022-02-20 23:54:17,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {16166#false} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {16166#false} is VALID [2022-02-20 23:54:17,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {16166#false} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset; {16166#false} is VALID [2022-02-20 23:54:17,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {16166#false} assume 0 == main_~list~0#1.offset; {16166#false} is VALID [2022-02-20 23:54:17,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {16166#false} assume main_~list~0#1.base < #StackHeapBarrier; {16166#false} is VALID [2022-02-20 23:54:17,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {16166#false} assume 0 == main_~list~0#1.base || 1 == #valid[main_~list~0#1.base];call ULTIMATE.dealloc(main_~list~0#1.base, main_~list~0#1.offset); {16166#false} is VALID [2022-02-20 23:54:17,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {16166#false} assume !(1 == #valid[main_~end~0#1.base]); {16166#false} is VALID [2022-02-20 23:54:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:17,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:17,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583487923] [2022-02-20 23:54:17,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583487923] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:17,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638229562] [2022-02-20 23:54:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:17,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:17,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:17,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:54:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:18,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:54:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:18,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:18,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:54:18,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:54:18,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {16165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {16165#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {16165#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {16165#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {16165#true} is VALID [2022-02-20 23:54:18,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {16165#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {16165#true} is VALID [2022-02-20 23:54:18,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {16165#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 23:54:18,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {16251#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem18#1|)} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {16251#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem18#1|)} assume ~unnamed1~0~RED == main_#t~mem18#1;havoc main_#t~mem18#1; {16166#false} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {16166#false} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {16166#false} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {16166#false} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset; {16166#false} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {16166#false} assume 0 == main_~list~0#1.offset; {16166#false} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {16166#false} assume main_~list~0#1.base < #StackHeapBarrier; {16166#false} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {16166#false} assume 0 == main_~list~0#1.base || 1 == #valid[main_~list~0#1.base];call ULTIMATE.dealloc(main_~list~0#1.base, main_~list~0#1.offset); {16166#false} is VALID [2022-02-20 23:54:18,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {16166#false} assume !(1 == #valid[main_~end~0#1.base]); {16166#false} is VALID [2022-02-20 23:54:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:54:18,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:18,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638229562] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:18,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:54:18,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-02-20 23:54:18,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103008793] [2022-02-20 23:54:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:18,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:54:18,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:18,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:18,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:18,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:18,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:18,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:18,180 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:18,362 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-02-20 23:54:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:18,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:54:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-02-20 23:54:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-02-20 23:54:18,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-02-20 23:54:18,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:18,450 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:54:18,450 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:54:18,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:54:18,451 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:18,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 278 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:54:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:54:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2022-02-20 23:54:18,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:18,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,454 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,454 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:18,456 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-02-20 23:54:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2022-02-20 23:54:18,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:18,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:18,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 23:54:18,457 INFO L87 Difference]: Start difference. First operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 23:54:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:18,459 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-02-20 23:54:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2022-02-20 23:54:18,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:18,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:18,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:18,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2022-02-20 23:54:18,462 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 33 [2022-02-20 23:54:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:18,462 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2022-02-20 23:54:18,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2022-02-20 23:54:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:54:18,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:18,463 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:18,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:18,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:18,672 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2022-02-20 23:54:18,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:18,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231548356] [2022-02-20 23:54:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:18,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {16912#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {16912#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {16912#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {16912#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {16912#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {16912#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {16912#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {16912#true} is VALID [2022-02-20 23:54:18,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {16912#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {16912#true} is VALID [2022-02-20 23:54:18,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {16912#true} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {16914#(and (= (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {16915#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem17#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem17#1.offset|))} is VALID [2022-02-20 23:54:18,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {16915#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem17#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem17#1.offset|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {16916#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:54:18,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {16916#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem18#1);havoc main_#t~mem18#1; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:18,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1075 {16918#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem21#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem21#1.base|))} is VALID [2022-02-20 23:54:18,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {16918#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem21#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem21#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:18,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume 0 == main_~list~0#1.offset; {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:18,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume main_~list~0#1.base < #StackHeapBarrier; {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:18,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume 0 == main_~list~0#1.base || 1 == #valid[main_~list~0#1.base];call ULTIMATE.dealloc(main_~list~0#1.base, main_~list~0#1.offset);main_~list~0#1.base, main_~list~0#1.offset := main_~end~0#1.base, main_~end~0#1.offset; {16920#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|))} is VALID [2022-02-20 23:54:18,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {16920#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16913#false} is VALID [2022-02-20 23:54:18,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {16913#false} assume !(1 == #valid[main_~list~0#1.base]); {16913#false} is VALID [2022-02-20 23:54:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:18,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:18,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231548356] [2022-02-20 23:54:18,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231548356] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:18,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697811213] [2022-02-20 23:54:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:18,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:18,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:18,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:54:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:18,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:54:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:18,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:19,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:19,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:19,093 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:54:19,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:19,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:19,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:19,142 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:54:19,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:19,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:19,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:19,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:19,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {16912#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {16912#true} is VALID [2022-02-20 23:54:19,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {16912#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:19,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:19,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:19,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:19,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:54:19,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {16927#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem18#1);havoc main_#t~mem18#1; {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {16943#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1075 {17007#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem21#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem21#1.base|))} is VALID [2022-02-20 23:54:19,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {17007#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem21#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem21#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {17011#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} is VALID [2022-02-20 23:54:19,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {17011#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} assume 0 == main_~list~0#1.offset; {17011#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} is VALID [2022-02-20 23:54:19,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {17011#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} assume main_~list~0#1.base < #StackHeapBarrier; {17011#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} is VALID [2022-02-20 23:54:19,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {17011#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} assume 0 == main_~list~0#1.base || 1 == #valid[main_~list~0#1.base];call ULTIMATE.dealloc(main_~list~0#1.base, main_~list~0#1.offset);main_~list~0#1.base, main_~list~0#1.offset := main_~end~0#1.base, main_~end~0#1.offset; {17021#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|))} is VALID [2022-02-20 23:54:19,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {17021#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16913#false} is VALID [2022-02-20 23:54:19,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {16913#false} assume !(1 == #valid[main_~list~0#1.base]); {16913#false} is VALID [2022-02-20 23:54:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:54:19,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:19,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {16913#false} assume !(1 == #valid[main_~list~0#1.base]); {16913#false} is VALID [2022-02-20 23:54:19,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {16920#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16913#false} is VALID [2022-02-20 23:54:19,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume 0 == main_~list~0#1.base || 1 == #valid[main_~list~0#1.base];call ULTIMATE.dealloc(main_~list~0#1.base, main_~list~0#1.offset);main_~list~0#1.base, main_~list~0#1.offset := main_~end~0#1.base, main_~end~0#1.offset; {16920#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|))} is VALID [2022-02-20 23:54:19,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume main_~list~0#1.base < #StackHeapBarrier; {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:19,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume 0 == main_~list~0#1.offset; {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:19,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {16918#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem21#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem21#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {16919#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:54:19,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1075 {16918#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem21#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem21#1.base|))} is VALID [2022-02-20 23:54:19,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem18#1);havoc main_#t~mem18#1; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {16917#(and (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:19,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {16912#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {16912#true} is VALID [2022-02-20 23:54:19,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {16912#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {16912#true} is VALID [2022-02-20 23:54:19,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {16912#true} is VALID [2022-02-20 23:54:19,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {16912#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {16912#true} is VALID [2022-02-20 23:54:19,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {16912#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {16912#true} is VALID [2022-02-20 23:54:19,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {16912#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {16912#true} is VALID [2022-02-20 23:54:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:54:19,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697811213] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:19,816 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:19,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2022-02-20 23:54:19,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97921275] [2022-02-20 23:54:19,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:54:19,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:19,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:19,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:19,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:54:19,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:54:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:54:19,878 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:21,248 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2022-02-20 23:54:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:54:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:54:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 202 transitions. [2022-02-20 23:54:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 202 transitions. [2022-02-20 23:54:21,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 202 transitions. [2022-02-20 23:54:21,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:21,400 INFO L225 Difference]: With dead ends: 210 [2022-02-20 23:54:21,400 INFO L226 Difference]: Without dead ends: 210 [2022-02-20 23:54:21,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:54:21,400 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 269 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:21,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 513 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:54:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-02-20 23:54:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 166. [2022-02-20 23:54:21,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:21,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,404 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,404 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:21,407 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2022-02-20 23:54:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2022-02-20 23:54:21,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:21,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:21,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 210 states. [2022-02-20 23:54:21,408 INFO L87 Difference]: Start difference. First operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 210 states. [2022-02-20 23:54:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:21,411 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2022-02-20 23:54:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2022-02-20 23:54:21,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:21,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:21,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:21,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2022-02-20 23:54:21,414 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 34 [2022-02-20 23:54:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:21,414 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2022-02-20 23:54:21,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2022-02-20 23:54:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:54:21,415 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:21,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:21,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:21,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:21,638 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash 572484842, now seen corresponding path program 1 times [2022-02-20 23:54:21,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:21,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214146833] [2022-02-20 23:54:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:21,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {17941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2); {17941#true} is VALID [2022-02-20 23:54:21,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {17941#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1007 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1007-1 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 8 + main_~null~0#1.offset, 4); srcloc: L1008 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1012 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1012-1 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1013 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} goto; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1050-4 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} goto; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem14#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); srcloc: L1053 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1053-2 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem18#1 := read~int(main_~list~0#1.base, 8 + main_~list~0#1.offset, 4); srcloc: L1066 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(~unnamed1~0~RED == main_#t~mem18#1);havoc main_#t~mem18#1; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1075 {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume 0 == main_~list~0#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume main_~list~0#1.base < #StackHeapBarrier; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume 0 == main_~list~0#1.base || 1 == #valid[main_~list~0#1.base];call ULTIMATE.dealloc(main_~list~0#1.base, main_~list~0#1.offset);main_~list~0#1.base, main_~list~0#1.offset := main_~end~0#1.base, main_~end~0#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume 0 == main_~null~0#1.offset; {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:21,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {17943#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(main_~null~0#1.base < #StackHeapBarrier); {17942#false} is VALID [2022-02-20 23:54:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:54:21,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:21,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214146833] [2022-02-20 23:54:21,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214146833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:21,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:21,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:21,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176740984] [2022-02-20 23:54:21,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 23:54:21,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:21,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:21,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:21,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:21,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:21,735 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:21,819 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-02-20 23:54:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 23:54:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 23:54:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 23:54:21,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2022-02-20 23:54:21,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:21,900 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:54:21,900 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:54:21,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:21,901 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:21,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:54:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:54:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-02-20 23:54:21,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:21,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,904 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,904 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:21,906 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-02-20 23:54:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2022-02-20 23:54:21,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:21,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:21,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 23:54:21,906 INFO L87 Difference]: Start difference. First operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 23:54:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:21,908 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-02-20 23:54:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2022-02-20 23:54:21,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:21,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:21,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:21,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2022-02-20 23:54:21,910 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 35 [2022-02-20 23:54:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:21,910 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2022-02-20 23:54:21,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2022-02-20 23:54:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 23:54:21,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:21,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:21,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:54:21,911 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash 402130029, now seen corresponding path program 1 times [2022-02-20 23:54:21,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:21,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271250808] [2022-02-20 23:54:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:21,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:54:21,953 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.closeWeakPath(ArrayInterpolator.java:1402) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateWeakPathInfo(ArrayInterpolator.java:1070) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.buildRecursiveInterpolant(ArrayInterpolator.java:2229) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateStorePathInfoExt(ArrayInterpolator.java:1206) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeWeakeqExtInterpolants(ArrayInterpolator.java:306) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeInterpolants(ArrayInterpolator.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:326) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:145) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:250) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:54:21,962 INFO L158 Benchmark]: Toolchain (without parser) took 25516.02ms. Allocated memory was 107.0MB in the beginning and 234.9MB in the end (delta: 127.9MB). Free memory was 75.1MB in the beginning and 205.0MB in the end (delta: -130.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:54:21,963 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 64.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:54:21,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.41ms. Allocated memory is still 107.0MB. Free memory was 75.1MB in the beginning and 72.1MB in the end (delta: 2.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:54:21,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.49ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 69.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:54:21,965 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 66.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:54:21,965 INFO L158 Benchmark]: RCFGBuilder took 732.98ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 66.9MB in the beginning and 100.3MB in the end (delta: -33.4MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-02-20 23:54:21,965 INFO L158 Benchmark]: TraceAbstraction took 24303.91ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 99.8MB in the beginning and 205.0MB in the end (delta: -105.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:54:21,967 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 64.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.41ms. Allocated memory is still 107.0MB. Free memory was 75.1MB in the beginning and 72.1MB in the end (delta: 2.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.49ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 69.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 107.0MB. Free memory was 69.4MB in the beginning and 66.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 732.98ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 66.9MB in the beginning and 100.3MB in the end (delta: -33.4MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24303.91ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 99.8MB in the beginning and 205.0MB in the end (delta: -105.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:54:22,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:54:23,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:54:23,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:54:23,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:54:23,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:54:23,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:54:23,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:54:23,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:54:23,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:54:23,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:54:23,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:54:23,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:54:23,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:54:23,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:54:23,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:54:23,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:54:23,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:54:23,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:54:23,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:54:23,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:54:23,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:54:23,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:54:23,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:54:23,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:54:23,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:54:23,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:54:23,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:54:23,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:54:23,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:54:23,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:54:23,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:54:23,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:54:23,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:54:23,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:54:23,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:54:23,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:54:23,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:54:23,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:54:23,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:54:23,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:54:23,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:54:23,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:54:23,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:54:23,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:54:23,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:54:23,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:54:23,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:54:23,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:54:23,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:54:23,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:54:23,999 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:54:23,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:54:24,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:54:24,000 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:54:24,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:54:24,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:54:24,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:54:24,001 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:54:24,001 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:54:24,001 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:54:24,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:54:24,001 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:54:24,002 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:54:24,002 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:54:24,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:54:24,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:54:24,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:54:24,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:54:24,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:54:24,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:24,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:54:24,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:54:24,003 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:54:24,004 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:54:24,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:54:24,004 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2022-02-20 23:54:24,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:54:24,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:54:24,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:54:24,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:54:24,341 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:54:24,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-02-20 23:54:24,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fcf3382/7163f653e53f444c8a3d583e8290cfbc/FLAG98534895b [2022-02-20 23:54:24,893 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:54:24,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-02-20 23:54:24,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fcf3382/7163f653e53f444c8a3d583e8290cfbc/FLAG98534895b [2022-02-20 23:54:25,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fcf3382/7163f653e53f444c8a3d583e8290cfbc [2022-02-20 23:54:25,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:54:25,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:54:25,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:25,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:54:25,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:54:25,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:25,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d8e79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25, skipping insertion in model container [2022-02-20 23:54:25,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:25,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:54:25,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:54:25,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-02-20 23:54:25,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-02-20 23:54:25,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-02-20 23:54:25,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-02-20 23:54:25,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-02-20 23:54:25,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-02-20 23:54:25,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-02-20 23:54:25,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:25,803 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:54:25,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-02-20 23:54:25,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-02-20 23:54:25,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-02-20 23:54:25,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-02-20 23:54:25,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-02-20 23:54:25,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-02-20 23:54:25,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-02-20 23:54:25,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:25,904 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:54:25,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25 WrapperNode [2022-02-20 23:54:25,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:25,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:25,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:54:25,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:54:25,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:25,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:25,989 INFO L137 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 168 [2022-02-20 23:54:25,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:25,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:54:25,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:54:25,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:54:26,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:54:26,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:54:26,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:54:26,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:54:26,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (1/1) ... [2022-02-20 23:54:26,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:26,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:54:26,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:54:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:54:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:54:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:54:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:54:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:54:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:54:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:54:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:54:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:54:26,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:54:26,227 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:54:26,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:54:26,854 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:54:26,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:54:26,861 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 23:54:26,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:26 BoogieIcfgContainer [2022-02-20 23:54:26,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:54:26,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:54:26,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:54:26,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:54:26,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:54:25" (1/3) ... [2022-02-20 23:54:26,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c45443d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:26, skipping insertion in model container [2022-02-20 23:54:26,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:25" (2/3) ... [2022-02-20 23:54:26,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c45443d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:26, skipping insertion in model container [2022-02-20 23:54:26,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:26" (3/3) ... [2022-02-20 23:54:26,871 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2022-02-20 23:54:26,875 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:54:26,877 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-02-20 23:54:26,920 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:54:26,926 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:54:26,927 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-02-20 23:54:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 88 states have (on average 2.25) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:26,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:26,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:26,952 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:54:26,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:26,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854676381] [2022-02-20 23:54:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:26,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:26,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:26,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:26,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:54:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:27,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:54:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:27,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:27,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:27,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {172#true} is VALID [2022-02-20 23:54:27,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {180#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:27,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~null~0#1.base]); {173#false} is VALID [2022-02-20 23:54:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:27,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:27,153 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:27,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854676381] [2022-02-20 23:54:27,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854676381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:27,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:27,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:27,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548623422] [2022-02-20 23:54:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:27,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:27,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:27,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:27,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:27,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:27,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:27,218 INFO L87 Difference]: Start difference. First operand has 169 states, 88 states have (on average 2.25) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:27,862 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2022-02-20 23:54:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:27,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2022-02-20 23:54:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2022-02-20 23:54:27,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 232 transitions. [2022-02-20 23:54:28,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:28,184 INFO L225 Difference]: With dead ends: 196 [2022-02-20 23:54:28,185 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 23:54:28,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:28,189 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 149 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:28,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 115 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 23:54:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 168. [2022-02-20 23:54:28,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:28,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 168 states, 91 states have (on average 1.934065934065934) internal successors, (176), 167 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:28,232 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 168 states, 91 states have (on average 1.934065934065934) internal successors, (176), 167 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:28,233 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 168 states, 91 states have (on average 1.934065934065934) internal successors, (176), 167 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,246 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2022-02-20 23:54:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2022-02-20 23:54:28,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:28,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:28,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 91 states have (on average 1.934065934065934) internal successors, (176), 167 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 194 states. [2022-02-20 23:54:28,251 INFO L87 Difference]: Start difference. First operand has 168 states, 91 states have (on average 1.934065934065934) internal successors, (176), 167 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 194 states. [2022-02-20 23:54:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,279 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2022-02-20 23:54:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2022-02-20 23:54:28,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:28,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:28,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:28,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 91 states have (on average 1.934065934065934) internal successors, (176), 167 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2022-02-20 23:54:28,292 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 3 [2022-02-20 23:54:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:28,293 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2022-02-20 23:54:28,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2022-02-20 23:54:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:28,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:28,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:28,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:28,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:28,510 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:54:28,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:28,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104845297] [2022-02-20 23:54:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:28,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:28,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:28,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:28,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:54:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:28,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:54:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:28,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:28,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:28,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {935#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {935#true} is VALID [2022-02-20 23:54:28,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {935#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {943#(and (= (select |#length| |ULTIMATE.start_main_~null~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:28,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {943#(and (= (select |#length| |ULTIMATE.start_main_~null~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~null~0#1.offset), #length[main_~null~0#1.base]) && ~bvule32(main_~null~0#1.offset, ~bvadd32(4bv32, main_~null~0#1.offset))) && ~bvule32(0bv32, main_~null~0#1.offset)); {936#false} is VALID [2022-02-20 23:54:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:28,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:28,616 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:28,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104845297] [2022-02-20 23:54:28,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104845297] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:28,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:28,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:28,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974224133] [2022-02-20 23:54:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:28,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:28,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:28,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:28,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:28,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:28,628 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,241 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2022-02-20 23:54:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:29,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:54:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2022-02-20 23:54:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2022-02-20 23:54:29,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 169 transitions. [2022-02-20 23:54:29,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:29,472 INFO L225 Difference]: With dead ends: 164 [2022-02-20 23:54:29,472 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 23:54:29,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:29,473 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:29,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 88 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 23:54:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-02-20 23:54:29,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:29,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 91 states have (on average 1.879120879120879) internal successors, (171), 163 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,483 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 91 states have (on average 1.879120879120879) internal successors, (171), 163 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,483 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 91 states have (on average 1.879120879120879) internal successors, (171), 163 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,490 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2022-02-20 23:54:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2022-02-20 23:54:29,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:29,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:29,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 91 states have (on average 1.879120879120879) internal successors, (171), 163 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:29,495 INFO L87 Difference]: Start difference. First operand has 164 states, 91 states have (on average 1.879120879120879) internal successors, (171), 163 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 164 states. [2022-02-20 23:54:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,503 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2022-02-20 23:54:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2022-02-20 23:54:29,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:29,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:29,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:29,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 91 states have (on average 1.879120879120879) internal successors, (171), 163 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2022-02-20 23:54:29,514 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 3 [2022-02-20 23:54:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:29,514 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2022-02-20 23:54:29,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2022-02-20 23:54:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:54:29,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:29,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:29,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:54:29,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:29,724 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-02-20 23:54:29,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:29,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797288630] [2022-02-20 23:54:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:29,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:29,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:29,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:29,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:54:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:29,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:54:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:29,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:29,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:29,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {1602#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {1602#true} is VALID [2022-02-20 23:54:29,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {1602#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1602#true} is VALID [2022-02-20 23:54:29,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1602#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {1602#true} is VALID [2022-02-20 23:54:29,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {1602#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {1602#true} is VALID [2022-02-20 23:54:29,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {1602#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {1602#true} is VALID [2022-02-20 23:54:29,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {1602#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {1622#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:29,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {1622#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~list~0#1.base]); {1603#false} is VALID [2022-02-20 23:54:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:29,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:29,827 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:29,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797288630] [2022-02-20 23:54:29,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797288630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:29,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:29,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:29,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234977006] [2022-02-20 23:54:29,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:54:29,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:29,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:29,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:29,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:29,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:29,845 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,315 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2022-02-20 23:54:30,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:30,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:54:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-20 23:54:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-20 23:54:30,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-20 23:54:30,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:30,496 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:54:30,496 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:54:30,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:30,498 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 134 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:30,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 101 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:54:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-02-20 23:54:30,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:30,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 158 states, 92 states have (on average 1.8043478260869565) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,505 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 158 states, 92 states have (on average 1.8043478260869565) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,505 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 158 states, 92 states have (on average 1.8043478260869565) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,509 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2022-02-20 23:54:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2022-02-20 23:54:30,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:30,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:30,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 92 states have (on average 1.8043478260869565) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:54:30,510 INFO L87 Difference]: Start difference. First operand has 158 states, 92 states have (on average 1.8043478260869565) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:54:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,514 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2022-02-20 23:54:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 166 transitions. [2022-02-20 23:54:30,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:30,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:30,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:30,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 92 states have (on average 1.8043478260869565) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2022-02-20 23:54:30,519 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 7 [2022-02-20 23:54:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:30,519 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2022-02-20 23:54:30,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2022-02-20 23:54:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:54:30,520 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:30,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:30,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:30,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:30,729 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-02-20 23:54:30,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:30,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776340739] [2022-02-20 23:54:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:30,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:30,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:54:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:30,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:54:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:30,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:30,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:30,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {2263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {2263#true} is VALID [2022-02-20 23:54:30,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2263#true} is VALID [2022-02-20 23:54:30,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {2263#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {2263#true} is VALID [2022-02-20 23:54:30,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {2263#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {2263#true} is VALID [2022-02-20 23:54:30,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {2263#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {2263#true} is VALID [2022-02-20 23:54:30,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {2263#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {2283#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:30,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {2283#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~list~0#1.offset), #length[main_~list~0#1.base]) && ~bvule32(main_~list~0#1.offset, ~bvadd32(4bv32, main_~list~0#1.offset))) && ~bvule32(0bv32, main_~list~0#1.offset)); {2264#false} is VALID [2022-02-20 23:54:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:30,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:30,852 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:30,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776340739] [2022-02-20 23:54:30,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776340739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:30,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:30,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:30,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646232784] [2022-02-20 23:54:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:54:30,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:30,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:30,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:30,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:30,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:30,867 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,373 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2022-02-20 23:54:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:54:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:54:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:54:31,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:54:31,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:31,588 INFO L225 Difference]: With dead ends: 175 [2022-02-20 23:54:31,588 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 23:54:31,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:31,589 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 132 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:31,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 110 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 23:54:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2022-02-20 23:54:31,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:31,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 161 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,596 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 161 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,597 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 161 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,600 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2022-02-20 23:54:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 181 transitions. [2022-02-20 23:54:31,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:31,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:31,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 161 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states. [2022-02-20 23:54:31,602 INFO L87 Difference]: Start difference. First operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 161 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states. [2022-02-20 23:54:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,608 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2022-02-20 23:54:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 181 transitions. [2022-02-20 23:54:31,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:31,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:31,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:31,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 161 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2022-02-20 23:54:31,613 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 7 [2022-02-20 23:54:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:31,614 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2022-02-20 23:54:31,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2022-02-20 23:54:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:54:31,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:31,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:31,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:31,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:31,824 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594255, now seen corresponding path program 1 times [2022-02-20 23:54:31,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:31,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372625526] [2022-02-20 23:54:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:31,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:31,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:54:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:31,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:54:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:31,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:31,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:32,046 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:54:32,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:54:32,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {2973#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {2973#true} is VALID [2022-02-20 23:54:32,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {2973#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2973#true} is VALID [2022-02-20 23:54:32,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {2973#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {2973#true} is VALID [2022-02-20 23:54:32,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {2973#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {2973#true} is VALID [2022-02-20 23:54:32,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {2973#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {2973#true} is VALID [2022-02-20 23:54:32,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {2973#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:32,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:32,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:32,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:32,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {2993#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {3006#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:32,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {3006#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12bv32); {3006#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:32,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {3006#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~end~0#1.base]); {2974#false} is VALID [2022-02-20 23:54:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:32,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:32,065 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:32,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372625526] [2022-02-20 23:54:32,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372625526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:32,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:32,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:32,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484833462] [2022-02-20 23:54:32,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:32,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:54:32,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:32,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:32,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:32,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:32,086 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:32,781 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2022-02-20 23:54:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:32,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:54:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2022-02-20 23:54:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2022-02-20 23:54:32,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 180 transitions. [2022-02-20 23:54:32,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:32,978 INFO L225 Difference]: With dead ends: 162 [2022-02-20 23:54:32,978 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 23:54:32,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:32,979 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 214 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:32,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 87 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 23:54:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2022-02-20 23:54:32,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:32,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 149 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,984 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 149 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,984 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 149 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:32,988 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2022-02-20 23:54:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2022-02-20 23:54:32,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:32,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:32,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 162 states. [2022-02-20 23:54:32,989 INFO L87 Difference]: Start difference. First operand has 149 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 162 states. [2022-02-20 23:54:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:32,993 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2022-02-20 23:54:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2022-02-20 23:54:32,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:32,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:32,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:32,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2022-02-20 23:54:32,997 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 12 [2022-02-20 23:54:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:32,997 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2022-02-20 23:54:32,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2022-02-20 23:54:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:54:32,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:32,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:33,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:33,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:33,208 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594254, now seen corresponding path program 1 times [2022-02-20 23:54:33,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:33,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372787420] [2022-02-20 23:54:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:33,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:33,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:33,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:33,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:54:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:33,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:54:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:33,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:33,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:33,460 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:33,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:54:33,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {3649#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {3649#true} is VALID [2022-02-20 23:54:33,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3649#true} is VALID [2022-02-20 23:54:33,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {3649#true} is VALID [2022-02-20 23:54:33,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {3649#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {3649#true} is VALID [2022-02-20 23:54:33,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {3649#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {3649#true} is VALID [2022-02-20 23:54:33,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {3649#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:33,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:33,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:33,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:33,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {3669#(and (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {3682#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:33,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {3682#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12bv32); {3682#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:33,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {3682#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~end~0#1.offset), #length[main_~end~0#1.base]) && ~bvule32(main_~end~0#1.offset, ~bvadd32(4bv32, main_~end~0#1.offset))) && ~bvule32(0bv32, main_~end~0#1.offset)); {3650#false} is VALID [2022-02-20 23:54:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:33,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:33,478 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:33,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372787420] [2022-02-20 23:54:33,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372787420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:33,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:33,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:33,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996555890] [2022-02-20 23:54:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:54:33,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:33,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:33,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:33,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:33,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:33,499 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,412 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2022-02-20 23:54:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:34,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:54:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-02-20 23:54:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-02-20 23:54:34,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-02-20 23:54:34,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:34,644 INFO L225 Difference]: With dead ends: 190 [2022-02-20 23:54:34,644 INFO L226 Difference]: Without dead ends: 190 [2022-02-20 23:54:34,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:34,645 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 184 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:34,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 129 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-02-20 23:54:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2022-02-20 23:54:34,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:34,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,650 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,650 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,654 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2022-02-20 23:54:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2022-02-20 23:54:34,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:34,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:34,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 190 states. [2022-02-20 23:54:34,655 INFO L87 Difference]: Start difference. First operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 190 states. [2022-02-20 23:54:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,659 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2022-02-20 23:54:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2022-02-20 23:54:34,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:34,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:34,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:34,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 157 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2022-02-20 23:54:34,664 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 12 [2022-02-20 23:54:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:34,664 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2022-02-20 23:54:34,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2022-02-20 23:54:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:54:34,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:34,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:34,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:34,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:34,872 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 195115107, now seen corresponding path program 1 times [2022-02-20 23:54:34,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:34,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119095269] [2022-02-20 23:54:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:34,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:34,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:34,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:34,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:54:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:34,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:54:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:34,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:34,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:34,991 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:54:34,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:54:35,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {4418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {4418#true} is VALID [2022-02-20 23:54:35,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {4418#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:35,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:35,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:35,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:35,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {4426#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {4439#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4458#(not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:35,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {4458#(not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {4419#false} is VALID [2022-02-20 23:54:35,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {4419#false} assume !false; {4419#false} is VALID [2022-02-20 23:54:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:35,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:35,030 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:35,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119095269] [2022-02-20 23:54:35,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119095269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:35,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:35,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:54:35,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519987808] [2022-02-20 23:54:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:54:35,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:35,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:35,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:35,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:35,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:35,047 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:36,033 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2022-02-20 23:54:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:54:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2022-02-20 23:54:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2022-02-20 23:54:36,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 213 transitions. [2022-02-20 23:54:36,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:36,253 INFO L225 Difference]: With dead ends: 199 [2022-02-20 23:54:36,253 INFO L226 Difference]: Without dead ends: 199 [2022-02-20 23:54:36,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:36,254 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 297 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:36,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 153 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-02-20 23:54:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2022-02-20 23:54:36,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:36,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 159 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,260 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 159 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,260 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 159 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:36,265 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2022-02-20 23:54:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 209 transitions. [2022-02-20 23:54:36,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:36,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:36,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 199 states. [2022-02-20 23:54:36,266 INFO L87 Difference]: Start difference. First operand has 159 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 199 states. [2022-02-20 23:54:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:36,271 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2022-02-20 23:54:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 209 transitions. [2022-02-20 23:54:36,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:36,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:36,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:36,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2022-02-20 23:54:36,276 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 14 [2022-02-20 23:54:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:36,276 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2022-02-20 23:54:36,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2022-02-20 23:54:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:54:36,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:36,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:36,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:36,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:36,487 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997431, now seen corresponding path program 1 times [2022-02-20 23:54:36,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:36,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206280394] [2022-02-20 23:54:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:36,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:36,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:36,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:36,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:54:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:36,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:54:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:36,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:36,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:36,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:36,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:54:36,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {5224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {5224#true} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {5224#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5224#true} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {5224#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {5224#true} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {5224#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {5224#true} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {5224#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {5224#true} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {5224#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {5224#true} is VALID [2022-02-20 23:54:36,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {5224#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {5224#true} is VALID [2022-02-20 23:54:36,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {5224#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {5224#true} is VALID [2022-02-20 23:54:36,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {5224#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {5224#true} is VALID [2022-02-20 23:54:36,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {5224#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {5224#true} is VALID [2022-02-20 23:54:36,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {5224#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12bv32); {5259#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:36,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {5259#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1022 {5263#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:36,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {5263#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5263#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:36,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {5263#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1023 {5270#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:36,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {5270#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem5#1.base]); {5225#false} is VALID [2022-02-20 23:54:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:36,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:36,679 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:36,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206280394] [2022-02-20 23:54:36,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206280394] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:36,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:36,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:36,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109965230] [2022-02-20 23:54:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:54:36,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:36,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:36,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:36,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:36,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:36,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:36,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:36,699 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:37,740 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2022-02-20 23:54:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:54:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-02-20 23:54:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-02-20 23:54:37,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 137 transitions. [2022-02-20 23:54:37,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:37,880 INFO L225 Difference]: With dead ends: 158 [2022-02-20 23:54:37,881 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 23:54:37,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:37,882 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 9 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:37,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 344 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 23:54:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-02-20 23:54:37,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:37,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 158 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,886 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 158 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,886 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 158 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:37,889 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2022-02-20 23:54:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2022-02-20 23:54:37,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:37,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:37,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 158 states. [2022-02-20 23:54:37,890 INFO L87 Difference]: Start difference. First operand has 158 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 158 states. [2022-02-20 23:54:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:37,893 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2022-02-20 23:54:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2022-02-20 23:54:37,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:37,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:37,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:37,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2022-02-20 23:54:37,898 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 15 [2022-02-20 23:54:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:37,898 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2022-02-20 23:54:37,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2022-02-20 23:54:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:54:37,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:37,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:37,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:54:38,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:38,111 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997432, now seen corresponding path program 1 times [2022-02-20 23:54:38,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:38,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133910896] [2022-02-20 23:54:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:38,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:38,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:54:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:38,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:54:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:38,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:38,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:38,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:38,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:38,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:54:38,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:38,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {5909#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {5909#true} is VALID [2022-02-20 23:54:38,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {5909#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {5909#true} is VALID [2022-02-20 23:54:38,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {5909#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {5909#true} is VALID [2022-02-20 23:54:38,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {5909#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {5909#true} is VALID [2022-02-20 23:54:38,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {5909#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {5909#true} is VALID [2022-02-20 23:54:38,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {5909#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {5909#true} is VALID [2022-02-20 23:54:38,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {5909#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {5909#true} is VALID [2022-02-20 23:54:38,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {5909#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {5909#true} is VALID [2022-02-20 23:54:38,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {5909#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {5909#true} is VALID [2022-02-20 23:54:38,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {5909#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {5909#true} is VALID [2022-02-20 23:54:38,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {5909#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12bv32); {5944#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:54:38,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {5944#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1022 {5948#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:38,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5948#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:38,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {5948#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1023 {5955#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:54:38,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {5955#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem5#1.offset)), #length[main_#t~mem5#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem5#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem5#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem5#1.offset))); {5910#false} is VALID [2022-02-20 23:54:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:38,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:38,366 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:38,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133910896] [2022-02-20 23:54:38,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133910896] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:38,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:38,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:38,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218606042] [2022-02-20 23:54:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:54:38,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:38,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:38,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:38,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:38,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:38,386 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:39,474 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:54:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:54:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-02-20 23:54:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-02-20 23:54:39,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 136 transitions. [2022-02-20 23:54:39,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:39,588 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:54:39,588 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:54:39,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:54:39,589 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 4 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:39,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 335 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:54:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:54:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-02-20 23:54:39,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:39,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,593 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,594 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:39,596 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:54:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:54:39,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:39,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:39,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 23:54:39,597 INFO L87 Difference]: Start difference. First operand has 157 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 23:54:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:39,600 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:54:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:54:39,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:39,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:39,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:39,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-02-20 23:54:39,603 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 15 [2022-02-20 23:54:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:39,604 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-02-20 23:54:39,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:54:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:54:39,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:39,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:39,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:39,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:39,814 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1587467776, now seen corresponding path program 1 times [2022-02-20 23:54:39,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:39,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402251032] [2022-02-20 23:54:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:39,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:39,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:54:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:39,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:54:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:39,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:39,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:54:40,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:40,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {6590#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {6590#true} is VALID [2022-02-20 23:54:40,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {6590#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {6590#true} is VALID [2022-02-20 23:54:40,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {6590#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {6590#true} is VALID [2022-02-20 23:54:40,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {6590#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {6590#true} is VALID [2022-02-20 23:54:40,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {6590#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {6590#true} is VALID [2022-02-20 23:54:40,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {6590#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {6610#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:40,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {6610#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {6610#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:40,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {6610#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {6610#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:40,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {6610#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {6620#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|))) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:40,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {6620#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|))) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {6620#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|))) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:40,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {6620#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|))) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6620#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|))) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:40,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {6620#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|))) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {6630#(and (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:54:40,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {6630#(and (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|))))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {6630#(and (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:54:40,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {6630#(and (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {6630#(and (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:54:40,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {6630#(and (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem13#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); srcloc: L1050-4 {6640#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem13#1|)} is VALID [2022-02-20 23:54:40,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {6640#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem13#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {6591#false} is VALID [2022-02-20 23:54:40,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {6591#false} assume !false; {6591#false} is VALID [2022-02-20 23:54:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:40,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:40,061 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:40,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402251032] [2022-02-20 23:54:40,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402251032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:40,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:40,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:54:40,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687985275] [2022-02-20 23:54:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:54:40,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:40,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:40,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:40,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:54:40,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:54:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:54:40,087 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:41,245 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2022-02-20 23:54:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:54:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2022-02-20 23:54:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2022-02-20 23:54:41,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 210 transitions. [2022-02-20 23:54:41,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:41,502 INFO L225 Difference]: With dead ends: 211 [2022-02-20 23:54:41,502 INFO L226 Difference]: Without dead ends: 211 [2022-02-20 23:54:41,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:54:41,503 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 232 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:41,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 363 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-20 23:54:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 162. [2022-02-20 23:54:41,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:41,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 162 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,507 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 162 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,508 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 162 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:41,511 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2022-02-20 23:54:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2022-02-20 23:54:41,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:41,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:41,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 211 states. [2022-02-20 23:54:41,513 INFO L87 Difference]: Start difference. First operand has 162 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 211 states. [2022-02-20 23:54:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:41,517 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2022-02-20 23:54:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2022-02-20 23:54:41,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:41,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:41,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:41,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2022-02-20 23:54:41,520 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 17 [2022-02-20 23:54:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:41,521 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2022-02-20 23:54:41,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2022-02-20 23:54:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:54:41,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:41,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:41,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:41,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:41,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128633, now seen corresponding path program 1 times [2022-02-20 23:54:41,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:41,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913009711] [2022-02-20 23:54:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:41,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:41,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:54:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:41,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:54:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:41,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:41,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:41,955 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:54:41,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:54:42,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:42,122 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:42,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:54:42,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:54:42,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {7445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {7445#true} is VALID [2022-02-20 23:54:42,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {7445#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {7445#true} is VALID [2022-02-20 23:54:42,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {7445#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {7445#true} is VALID [2022-02-20 23:54:42,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {7445#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {7445#true} is VALID [2022-02-20 23:54:42,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {7445#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {7445#true} is VALID [2022-02-20 23:54:42,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {7445#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:42,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:42,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:42,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:42,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {7465#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7478#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:42,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {7478#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12bv32); {7482#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)))} is VALID [2022-02-20 23:54:42,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {7482#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1022 {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:54:42,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:54:42,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1023 {7493#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:54:42,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {7493#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, ~bvadd32(4bv32, main_#t~mem5#1.offset), 4bv32); srcloc: L1023-1 {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:54:42,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:54:42,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {7486#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1024 {7503#(and (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem6#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:54:42,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {7503#(and (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem6#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv1 1)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {7507#(and (exists ((|v_ULTIMATE.start_main_~end~0#1.base_83| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_83|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~end~0#1.base_83| |ULTIMATE.start_main_~end~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:54:42,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {7507#(and (exists ((|v_ULTIMATE.start_main_~end~0#1.base_83| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_83|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~end~0#1.base_83| |ULTIMATE.start_main_~end~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~end~0#1.base]); {7446#false} is VALID [2022-02-20 23:54:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:42,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:42,287 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:42,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913009711] [2022-02-20 23:54:42,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913009711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:42,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:42,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:42,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318131253] [2022-02-20 23:54:42,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:54:42,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:42,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:42,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:42,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:42,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:42,321 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:43,804 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2022-02-20 23:54:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:54:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:54:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 183 transitions. [2022-02-20 23:54:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 183 transitions. [2022-02-20 23:54:43,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 183 transitions. [2022-02-20 23:54:44,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:44,006 INFO L225 Difference]: With dead ends: 193 [2022-02-20 23:54:44,006 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:54:44,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:54:44,007 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:44,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 247 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 246 Invalid, 0 Unknown, 180 Unchecked, 0.5s Time] [2022-02-20 23:54:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:54:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2022-02-20 23:54:44,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:44,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 160 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:44,010 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 160 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:44,011 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 160 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:44,014 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2022-02-20 23:54:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2022-02-20 23:54:44,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:44,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:44,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 160 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 23:54:44,015 INFO L87 Difference]: Start difference. First operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 160 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 23:54:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:44,018 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2022-02-20 23:54:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2022-02-20 23:54:44,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:44,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:44,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:44,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 160 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2022-02-20 23:54:44,022 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 19 [2022-02-20 23:54:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:44,022 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2022-02-20 23:54:44,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2022-02-20 23:54:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:54:44,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:44,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:44,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:44,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:44,233 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128634, now seen corresponding path program 1 times [2022-02-20 23:54:44,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:44,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019115293] [2022-02-20 23:54:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:44,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:44,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:44,235 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:44,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:54:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:44,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:54:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:44,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:44,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:44,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:44,465 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:54:44,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:54:44,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:44,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:44,618 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:44,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:54:44,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:54:44,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:54:44,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:44,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {8269#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {8269#true} is VALID [2022-02-20 23:54:44,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {8269#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {8269#true} is VALID [2022-02-20 23:54:44,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {8269#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {8269#true} is VALID [2022-02-20 23:54:44,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {8269#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {8269#true} is VALID [2022-02-20 23:54:44,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {8269#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {8269#true} is VALID [2022-02-20 23:54:44,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {8269#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:44,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:44,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:44,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:44,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {8289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8302#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:54:44,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {8302#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12bv32); {8306#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)))} is VALID [2022-02-20 23:54:44,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {8306#(and (= |ULTIMATE.start_main_#t~malloc4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1022 {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:44,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:44,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1023 {8317#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:44,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {8317#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem5#1.base, ~bvadd32(4bv32, main_#t~mem5#1.offset), 4bv32); srcloc: L1023-1 {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:44,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:54:44,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {8310#(and (not (= |ULTIMATE.start_main_~end~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1024 {8327#(and (= (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:44,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {8327#(and (= (select |#length| |ULTIMATE.start_main_#t~mem6#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset; {8331#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:44,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {8331#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~end~0#1.offset), #length[main_~end~0#1.base]) && ~bvule32(main_~end~0#1.offset, ~bvadd32(4bv32, main_~end~0#1.offset))) && ~bvule32(0bv32, main_~end~0#1.offset)); {8270#false} is VALID [2022-02-20 23:54:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:44,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:54:44,749 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:44,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019115293] [2022-02-20 23:54:44,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019115293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:44,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:44,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:44,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865844953] [2022-02-20 23:54:44,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:54:44,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:44,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:44,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:44,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:44,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:44,787 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:47,403 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2022-02-20 23:54:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:54:47,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:54:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2022-02-20 23:54:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2022-02-20 23:54:47,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 167 transitions. [2022-02-20 23:54:47,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:47,567 INFO L225 Difference]: With dead ends: 178 [2022-02-20 23:54:47,568 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 23:54:47,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:54:47,568 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 226 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:47,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 328 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 23:54:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 23:54:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-02-20 23:54:47,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:47,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 164 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,572 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 164 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,572 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 164 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:47,575 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2022-02-20 23:54:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-02-20 23:54:47,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:47,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:47,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 178 states. [2022-02-20 23:54:47,576 INFO L87 Difference]: Start difference. First operand has 164 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 178 states. [2022-02-20 23:54:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:47,579 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2022-02-20 23:54:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-02-20 23:54:47,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:47,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:47,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:47,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 179 transitions. [2022-02-20 23:54:47,582 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 179 transitions. Word has length 19 [2022-02-20 23:54:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:47,582 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 179 transitions. [2022-02-20 23:54:47,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2022-02-20 23:54:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:54:47,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:47,583 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:47,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:47,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:54:47,794 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:54:47,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1915505871, now seen corresponding path program 1 times [2022-02-20 23:54:47,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:54:47,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311484757] [2022-02-20 23:54:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:54:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:54:47,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:54:47,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:54:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:47,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:54:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:47,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:47,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:47,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:48,022 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:54:48,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:48,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:48,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:48,072 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:54:48,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:48,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:54:48,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:48,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:48,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {9058#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {9058#true} is VALID [2022-02-20 23:54:48,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {9058#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:48,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:48,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:48,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:48,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:54:48,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {9066#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {9082#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} goto; {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem13#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); srcloc: L1050-4 {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} goto; {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem14#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); srcloc: L1053 {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {9098#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1053-2 {9126#(and (= |ULTIMATE.start_main_#t~mem17#1.base| |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:54:48,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {9126#(and (= |ULTIMATE.start_main_#t~mem17#1.base| |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {9130#(and (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:48,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {9130#(and (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9059#false} is VALID [2022-02-20 23:54:48,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {9059#false} assume !(1bv1 == #valid[main_~end~0#1.base]); {9059#false} is VALID [2022-02-20 23:54:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:48,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:48,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {9059#false} assume !(1bv1 == #valid[main_~end~0#1.base]); {9059#false} is VALID [2022-02-20 23:54:48,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {9140#(and (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9059#false} is VALID [2022-02-20 23:54:48,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {9144#(and (= |ULTIMATE.start_main_#t~mem17#1.base| |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {9140#(and (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:54:48,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1053-2 {9144#(and (= |ULTIMATE.start_main_#t~mem17#1.base| |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_#t~mem17#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} is VALID [2022-02-20 23:54:48,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); srcloc: L1053 {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem13#1);havoc main_#t~mem13#1; {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem13#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); srcloc: L1050-4 {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~null~0#1.base, main_~null~0#1.offset;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9148#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) |ULTIMATE.start_main_~null~0#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:54:48,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:48,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:48,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32); srcloc: L1013 {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:48,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1012-1 {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:48,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {9058#true} SUMMARY for call write~$Pointer$(main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1012 {9176#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~null~0#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:54:48,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {9058#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset; {9058#true} is VALID [2022-02-20 23:54:48,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {9058#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(8bv32, main_~null~0#1.offset), 4bv32); srcloc: L1008 {9058#true} is VALID [2022-02-20 23:54:48,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {9058#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1007-1 {9058#true} is VALID [2022-02-20 23:54:48,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {9058#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1007 {9058#true} is VALID [2022-02-20 23:54:48,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {9058#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet3#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~null~0#1.base, main_~null~0#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~null~0#1.base, main_~null~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {9058#true} is VALID [2022-02-20 23:54:48,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {9058#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32); {9058#true} is VALID [2022-02-20 23:54:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:48,632 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:54:48,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311484757] [2022-02-20 23:54:48,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311484757] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:48,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:54:48,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-02-20 23:54:48,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412126951] [2022-02-20 23:54:48,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:54:48,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:48,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:54:48,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:48,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:54:48,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:54:48,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:54:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:54:48,697 INFO L87 Difference]: Start difference. First operand 164 states and 179 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)