./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.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/sll-rb-sentinel-1.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 b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:55:03,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:55:03,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:55:03,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:55:03,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:55:03,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:55:03,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:55:03,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:55:03,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:55:03,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:55:03,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:55:03,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:55:03,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:55:03,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:55:03,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:55:03,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:55:03,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:55:03,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:55:03,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:55:03,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:55:03,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:55:03,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:55:03,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:55:03,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:55:03,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:55:03,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:55:03,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:55:03,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:55:03,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:55:03,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:55:03,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:55:03,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:55:03,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:55:03,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:55:03,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:55:03,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:55:03,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:55:03,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:55:03,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:55:03,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:55:03,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:55:03,293 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:55:03,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:55:03,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:55:03,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:55:03,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:55:03,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:55:03,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:55:03,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:55:03,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:55:03,312 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:55:03,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:55:03,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:55:03,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:55:03,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:55:03,314 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:55:03,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:55:03,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:55:03,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:55:03,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:55:03,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:55:03,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:03,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:55:03,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:55:03,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:55:03,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:55:03,316 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 -> b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 [2022-02-20 23:55:03,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:55:03,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:55:03,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:55:03,549 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:55:03,549 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:55:03,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2022-02-20 23:55:03,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7e3b155/c4c6c091abcb4b6ea33a08b14150c87c/FLAGe3e7daa6e [2022-02-20 23:55:04,006 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:55:04,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2022-02-20 23:55:04,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7e3b155/c4c6c091abcb4b6ea33a08b14150c87c/FLAGe3e7daa6e [2022-02-20 23:55:04,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7e3b155/c4c6c091abcb4b6ea33a08b14150c87c [2022-02-20 23:55:04,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:55:04,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:55:04,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:04,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:55:04,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:55:04,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de5538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04, skipping insertion in model container [2022-02-20 23:55:04,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:55:04,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:55:04,365 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/sll-rb-sentinel-1.i[22534,22547] [2022-02-20 23:55:04,377 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/sll-rb-sentinel-1.i[22606,22619] [2022-02-20 23:55:04,378 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/sll-rb-sentinel-1.i[22746,22759] [2022-02-20 23:55:04,378 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/sll-rb-sentinel-1.i[22820,22833] [2022-02-20 23:55:04,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:04,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:55:04,411 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/sll-rb-sentinel-1.i[22534,22547] [2022-02-20 23:55:04,412 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/sll-rb-sentinel-1.i[22606,22619] [2022-02-20 23:55:04,413 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/sll-rb-sentinel-1.i[22746,22759] [2022-02-20 23:55:04,413 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/sll-rb-sentinel-1.i[22820,22833] [2022-02-20 23:55:04,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:04,432 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:55:04,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04 WrapperNode [2022-02-20 23:55:04,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:04,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:04,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:55:04,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:55:04,439 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:55:04" (1/1) ... [2022-02-20 23:55:04,447 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:55:04" (1/1) ... [2022-02-20 23:55:04,466 INFO L137 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2022-02-20 23:55:04,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:04,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:55:04,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:55:04,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:55:04,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:55:04,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:55:04,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:55:04,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:55:04,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (1/1) ... [2022-02-20 23:55:04,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:04,510 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:55:04,524 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:55:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:55:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:55:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:55:04,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:55:04,603 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:55:04,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:55:04,973 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:55:04,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:55:04,979 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 23:55:04,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:04 BoogieIcfgContainer [2022-02-20 23:55:04,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:55:04,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:55:04,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:55:04,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:55:04,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:55:04" (1/3) ... [2022-02-20 23:55:04,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e25695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:04, skipping insertion in model container [2022-02-20 23:55:04,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:04" (2/3) ... [2022-02-20 23:55:04,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e25695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:04, skipping insertion in model container [2022-02-20 23:55:04,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:04" (3/3) ... [2022-02-20 23:55:04,986 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2022-02-20 23:55:04,989 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:55:04,990 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-02-20 23:55:05,017 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:55:05,021 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:55:05,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-02-20 23:55:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:05,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:05,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:05,038 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:55:05,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:05,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366229781] [2022-02-20 23:55:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:05,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#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); {136#true} is VALID [2022-02-20 23:55:05,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {138#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:55:05,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} assume !(1 == #valid[main_~null~0#1.base]); {137#false} is VALID [2022-02-20 23:55:05,169 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:55:05,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:05,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366229781] [2022-02-20 23:55:05,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366229781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:05,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:05,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:05,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679279469] [2022-02-20 23:55:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:05,175 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:55:05,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:05,178 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:55:05,182 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:55:05,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:05,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:05,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:05,204 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 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:55:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,468 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2022-02-20 23:55:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:05,468 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:55:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:05,469 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:55:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2022-02-20 23:55:05,476 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:55:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2022-02-20 23:55:05,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 187 transitions. [2022-02-20 23:55:05,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:05,623 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:55:05,624 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 23:55:05,625 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:55:05,627 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:05,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 100 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 23:55:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2022-02-20 23:55:05,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:05,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:05,651 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:05,651 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,657 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2022-02-20 23:55:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2022-02-20 23:55:05,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:05,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:05,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 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 159 states. [2022-02-20 23:55:05,659 INFO L87 Difference]: Start difference. First operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 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 159 states. [2022-02-20 23:55:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,664 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2022-02-20 23:55:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2022-02-20 23:55:05,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:05,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:05,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:05,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.9054054054054055) internal successors, (141), 132 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2022-02-20 23:55:05,669 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 3 [2022-02-20 23:55:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:05,670 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2022-02-20 23:55:05,670 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:55:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2022-02-20 23:55:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:05,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:05,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:05,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:55:05,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:55:05,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:05,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560401736] [2022-02-20 23:55:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:05,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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); {753#true} is VALID [2022-02-20 23:55:05,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {755#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~null~0#1.base|)))} is VALID [2022-02-20 23:55:05,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {755#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~null~0#1.base|)))} assume !(4 + (4 + main_~null~0#1.offset) <= #length[main_~null~0#1.base] && 0 <= 4 + main_~null~0#1.offset); {754#false} is VALID [2022-02-20 23:55:05,707 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:55:05,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:05,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560401736] [2022-02-20 23:55:05,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560401736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:05,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:05,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:05,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233354869] [2022-02-20 23:55:05,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:05,709 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:55:05,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:05,710 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:55:05,712 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:55:05,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:05,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:05,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:05,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:05,714 INFO L87 Difference]: Start difference. First operand 133 states and 141 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:55:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:05,882 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-02-20 23:55:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:05,883 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:55:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:05,883 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:55:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 23:55:05,885 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:55:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 23:55:05,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-20 23:55:05,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:05,997 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:55:05,997 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:55:05,998 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:55:05,998 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:05,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 73 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:55:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-02-20 23:55:06,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:06,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,004 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,004 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,007 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-02-20 23:55:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-02-20 23:55:06,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:55:06,008 INFO L87 Difference]: Start difference. First operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:55:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,011 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-02-20 23:55:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-02-20 23:55:06,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:06,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2022-02-20 23:55:06,015 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 3 [2022-02-20 23:55:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:06,015 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2022-02-20 23:55:06,015 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:55:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-02-20 23:55:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:06,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:06,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:06,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:55:06,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-02-20 23:55:06,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:06,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267009019] [2022-02-20 23:55:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:06,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#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); {1278#true} is VALID [2022-02-20 23:55:06,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {1278#true} is VALID [2022-02-20 23:55:06,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {1278#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {1278#true} is VALID [2022-02-20 23:55:06,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {1278#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {1278#true} is VALID [2022-02-20 23:55:06,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {1278#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {1280#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} assume !(1 == #valid[main_~list~0#1.base]); {1279#false} is VALID [2022-02-20 23:55:06,052 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:55:06,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:06,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267009019] [2022-02-20 23:55:06,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267009019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:06,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:06,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:06,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218990008] [2022-02-20 23:55:06,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:06,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:06,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:06,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:06,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:06,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:06,060 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,205 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2022-02-20 23:55:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:06,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:55:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:55:06,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 23:55:06,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:06,304 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:55:06,304 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:55:06,305 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:55:06,306 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:06,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 82 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:55:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-02-20 23:55:06,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:06,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,310 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,311 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,315 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2022-02-20 23:55:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2022-02-20 23:55:06,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 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 127 states. [2022-02-20 23:55:06,316 INFO L87 Difference]: Start difference. First operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 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 127 states. [2022-02-20 23:55:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,319 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2022-02-20 23:55:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2022-02-20 23:55:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:06,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.7733333333333334) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-02-20 23:55:06,324 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2022-02-20 23:55:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:06,324 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-02-20 23:55:06,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-02-20 23:55:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:06,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:06,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:06,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:55:06,325 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-02-20 23:55:06,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:06,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136102421] [2022-02-20 23:55:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:06,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {1789#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); {1789#true} is VALID [2022-02-20 23:55:06,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {1789#true} is VALID [2022-02-20 23:55:06,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {1789#true} is VALID [2022-02-20 23:55:06,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {1789#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {1789#true} is VALID [2022-02-20 23:55:06,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {1789#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {1791#(and (= (+ (select |#length| |ULTIMATE.start_main_~list~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:06,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {1791#(and (= (+ (select |#length| |ULTIMATE.start_main_~list~0#1.base|) (- 8)) 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); {1790#false} is VALID [2022-02-20 23:55:06,363 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:55:06,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:06,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136102421] [2022-02-20 23:55:06,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136102421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:06,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:06,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:06,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405040007] [2022-02-20 23:55:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:06,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:06,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:06,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:06,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:06,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:06,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:06,370 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,548 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-02-20 23:55:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2022-02-20 23:55:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2022-02-20 23:55:06,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2022-02-20 23:55:06,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:06,655 INFO L225 Difference]: With dead ends: 143 [2022-02-20 23:55:06,655 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 23:55:06,655 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:55:06,656 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:06,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 91 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 23:55:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2022-02-20 23:55:06,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:06,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,660 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,661 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,663 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-02-20 23:55:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-02-20 23:55:06,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 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 143 states. [2022-02-20 23:55:06,664 INFO L87 Difference]: Start difference. First operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 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 143 states. [2022-02-20 23:55:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,666 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-02-20 23:55:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-02-20 23:55:06,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:06,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:06,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:06,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2022-02-20 23:55:06,669 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 6 [2022-02-20 23:55:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:06,670 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2022-02-20 23:55:06,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-02-20 23:55:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:06,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:06,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:06,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:55:06,671 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 171980525, now seen corresponding path program 1 times [2022-02-20 23:55:06,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:06,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913665742] [2022-02-20 23:55:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:06,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {2353#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); {2353#true} is VALID [2022-02-20 23:55:06,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {2353#true} is VALID [2022-02-20 23:55:06,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {2353#true} is VALID [2022-02-20 23:55:06,726 INFO L290 TraceCheckUtils]: 3: Hoare triple {2353#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {2353#true} is VALID [2022-02-20 23:55:06,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {2353#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {2355#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {2355#(= (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: L1010 {2355#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {2355#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {2355#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {2355#(= (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; {2356#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {2356#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2356#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {2356#(= (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(8); {2356#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:06,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {2356#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {2354#false} is VALID [2022-02-20 23:55:06,730 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:55:06,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:06,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913665742] [2022-02-20 23:55:06,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913665742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:06,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:06,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:06,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546598466] [2022-02-20 23:55:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:55:06,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:06,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:06,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:06,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:06,740 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:06,949 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-02-20 23:55:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:06,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:55:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2022-02-20 23:55:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2022-02-20 23:55:06,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 148 transitions. [2022-02-20 23:55:07,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:07,049 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:55:07,049 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:55:07,050 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:55:07,050 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 161 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:07,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:55:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2022-02-20 23:55:07,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:07,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,054 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,054 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,062 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-02-20 23:55:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-02-20 23:55:07,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:07,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:07,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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 134 states. [2022-02-20 23:55:07,064 INFO L87 Difference]: Start difference. First operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 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 134 states. [2022-02-20 23:55:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,066 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-02-20 23:55:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-02-20 23:55:07,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:07,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:07,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:07,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-02-20 23:55:07,069 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 11 [2022-02-20 23:55:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:07,069 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-02-20 23:55:07,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-02-20 23:55:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:07,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:07,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:07,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:55:07,071 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash 171980526, now seen corresponding path program 1 times [2022-02-20 23:55:07,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:07,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446232579] [2022-02-20 23:55:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:07,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#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); {2884#true} is VALID [2022-02-20 23:55:07,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {2884#true} is VALID [2022-02-20 23:55:07,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {2884#true} is VALID [2022-02-20 23:55:07,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {2884#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {2884#true} is VALID [2022-02-20 23:55:07,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {2884#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {2886#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {2886#(and (= 8 (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: L1010 {2886#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {2886#(and (= 8 (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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {2886#(and (= 8 (select |#length| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {2886#(and (= 8 (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; {2887#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {2887#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2887#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {2887#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {2887#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:07,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {2887#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {2885#false} is VALID [2022-02-20 23:55:07,176 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:55:07,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:07,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446232579] [2022-02-20 23:55:07,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446232579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:07,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:07,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:07,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130230575] [2022-02-20 23:55:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:07,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:55:07,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:07,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:07,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:07,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:07,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:07,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:07,186 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,469 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-02-20 23:55:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:07,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:55:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-02-20 23:55:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-02-20 23:55:07,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-02-20 23:55:07,583 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:55:07,584 INFO L225 Difference]: With dead ends: 158 [2022-02-20 23:55:07,585 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 23:55:07,585 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:55:07,588 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 149 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:07,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 102 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 23:55:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2022-02-20 23:55:07,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:07,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,600 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,600 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,604 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-02-20 23:55:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2022-02-20 23:55:07,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:07,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:07,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 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:55:07,605 INFO L87 Difference]: Start difference. First operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 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:55:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,608 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-02-20 23:55:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2022-02-20 23:55:07,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:07,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:07,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:07,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-02-20 23:55:07,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 11 [2022-02-20 23:55:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:07,619 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-02-20 23:55:07,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-02-20 23:55:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:55:07,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:07,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:07,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:55:07,620 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2064509497, now seen corresponding path program 1 times [2022-02-20 23:55:07,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:07,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851316260] [2022-02-20 23:55:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:07,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {3494#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); {3494#true} is VALID [2022-02-20 23:55:07,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {3494#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {3494#true} is VALID [2022-02-20 23:55:07,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {3496#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:55:07,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {3496#(= (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: L1006-1 {3496#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} is VALID [2022-02-20 23:55:07,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {3496#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) 1)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {3497#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:07,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {3497#(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: L1010 {3497#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:07,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {3497#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {3497#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:07,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {3497#(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; {3497#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:07,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {3497#(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; {3497#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:07,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {3497#(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; {3497#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:07,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {3497#(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; {3498#(not (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_~end~0#1.base|))} is VALID [2022-02-20 23:55:07,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {3498#(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); {3495#false} is VALID [2022-02-20 23:55:07,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {3495#false} assume !false; {3495#false} is VALID [2022-02-20 23:55:07,668 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:55:07,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:07,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851316260] [2022-02-20 23:55:07,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851316260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:07,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:07,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:07,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619535732] [2022-02-20 23:55:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:07,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:07,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:07,677 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:55:07,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:07,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:07,680 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:07,977 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-02-20 23:55:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:07,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2022-02-20 23:55:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2022-02-20 23:55:07,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 181 transitions. [2022-02-20 23:55:08,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:08,100 INFO L225 Difference]: With dead ends: 167 [2022-02-20 23:55:08,100 INFO L226 Difference]: Without dead ends: 167 [2022-02-20 23:55:08,100 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:55:08,101 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 230 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:08,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 129 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-02-20 23:55:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2022-02-20 23:55:08,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:08,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,104 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,104 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,107 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-02-20 23:55:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2022-02-20 23:55:08,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 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 167 states. [2022-02-20 23:55:08,108 INFO L87 Difference]: Start difference. First operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 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 167 states. [2022-02-20 23:55:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,111 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-02-20 23:55:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2022-02-20 23:55:08,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:08,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-02-20 23:55:08,113 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 13 [2022-02-20 23:55:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:08,113 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-02-20 23:55:08,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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:55:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-02-20 23:55:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:08,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:08,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:08,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:55:08,114 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash -264176465, now seen corresponding path program 1 times [2022-02-20 23:55:08,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:08,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831545724] [2022-02-20 23:55:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:08,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:08,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {4135#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); {4135#true} is VALID [2022-02-20 23:55:08,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {4135#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {4135#true} is VALID [2022-02-20 23:55:08,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {4135#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {4135#true} is VALID [2022-02-20 23:55:08,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {4135#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {4135#true} is VALID [2022-02-20 23:55:08,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {4135#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {4135#true} is VALID [2022-02-20 23:55:08,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {4135#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: L1010 {4135#true} is VALID [2022-02-20 23:55:08,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {4135#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {4135#true} is VALID [2022-02-20 23:55:08,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {4135#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4135#true} is VALID [2022-02-20 23:55:08,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {4135#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4135#true} is VALID [2022-02-20 23:55:08,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {4135#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(8); {4137#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1)} is VALID [2022-02-20 23:55:08,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {4137#(= (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: L1019 {4138#(= (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:55:08,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {4138#(= (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; {4138#(= (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:55:08,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {4138#(= (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: L1020 {4139#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:55:08,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {4139#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {4140#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:08,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {4140#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {4136#false} is VALID [2022-02-20 23:55:08,172 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:55:08,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:08,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831545724] [2022-02-20 23:55:08,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831545724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:08,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:08,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:08,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639135068] [2022-02-20 23:55:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:08,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,183 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:55:08,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:08,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:08,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:08,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:08,184 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,603 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:55:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:08,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-02-20 23:55:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-02-20 23:55:08,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2022-02-20 23:55:08,677 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:55:08,678 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:55:08,679 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:55:08,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:08,679 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:08,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 264 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:55:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-02-20 23:55:08,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:08,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,682 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,682 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,684 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:55:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-02-20 23:55:08,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 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 129 states. [2022-02-20 23:55:08,685 INFO L87 Difference]: Start difference. First operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 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 129 states. [2022-02-20 23:55:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:08,687 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-02-20 23:55:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-02-20 23:55:08,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:08,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:08,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:08,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-02-20 23:55:08,690 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 15 [2022-02-20 23:55:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:08,690 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-02-20 23:55:08,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-02-20 23:55:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:08,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:08,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:08,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:55:08,691 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash -264176464, now seen corresponding path program 1 times [2022-02-20 23:55:08,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:08,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616324963] [2022-02-20 23:55:08,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:08,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#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); {4666#true} is VALID [2022-02-20 23:55:08,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {4666#true} is VALID [2022-02-20 23:55:08,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {4666#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {4666#true} is VALID [2022-02-20 23:55:08,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {4666#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {4666#true} is VALID [2022-02-20 23:55:08,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {4666#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {4666#true} is VALID [2022-02-20 23:55:08,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {4666#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: L1010 {4666#true} is VALID [2022-02-20 23:55:08,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {4666#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {4666#true} is VALID [2022-02-20 23:55:08,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {4666#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4666#true} is VALID [2022-02-20 23:55:08,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {4666#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4666#true} is VALID [2022-02-20 23:55:08,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {4666#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(8); {4668#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 8) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0))} is VALID [2022-02-20 23:55:08,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {4668#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 8) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0))} 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: L1019 {4669#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:08,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {4669#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {4669#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:08,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {4669#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} 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: L1020 {4670#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 8))} is VALID [2022-02-20 23:55:08,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {4670#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 8))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {4671#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:55:08,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {4671#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (- 8)) 0))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {4667#false} is VALID [2022-02-20 23:55:08,762 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:55:08,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:08,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616324963] [2022-02-20 23:55:08,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616324963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:08,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:08,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:08,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511635568] [2022-02-20 23:55:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:08,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:08,773 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:55:08,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:08,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:08,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:08,774 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,257 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:55:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-02-20 23:55:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-02-20 23:55:09,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 118 transitions. [2022-02-20 23:55:09,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:09,333 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:55:09,333 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:55:09,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:09,334 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:09,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 307 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:55:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2022-02-20 23:55:09,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:09,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,336 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,337 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,339 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:55:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:55:09,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:09,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:09,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:55:09,339 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:55:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:09,342 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:55:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:55:09,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:09,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:09,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:09,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.425531914893617) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-02-20 23:55:09,344 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2022-02-20 23:55:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:09,345 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-02-20 23:55:09,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:55:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-02-20 23:55:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:55:09,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:09,345 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:55:09,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:55:09,346 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -125261441, now seen corresponding path program 1 times [2022-02-20 23:55:09,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:09,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724755352] [2022-02-20 23:55:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:09,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {5199#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); {5199#true} is VALID [2022-02-20 23:55:09,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {5199#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {5201#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:09,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {5201#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {5201#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:09,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {5201#(= |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: L1006-1 {5201#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:09,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {5201#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {5202#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {5202#(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: L1010 {5202#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {5202#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {5203#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {5203#(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| 4))) (= |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; {5203#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {5203#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {5203#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {5203#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {5203#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {5203#(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| 4))) (= |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; {5204#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:09,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {5204#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~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); {5205#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:09,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {5205#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:09,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {5206#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:09,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {5206#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {5200#false} is VALID [2022-02-20 23:55:09,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {5200#false} assume !false; {5200#false} is VALID [2022-02-20 23:55:09,461 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:55:09,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:09,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724755352] [2022-02-20 23:55:09,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724755352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:09,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:09,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:55:09,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268602401] [2022-02-20 23:55:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:09,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:09,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:09,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:09,475 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:55:09,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:55:09,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:09,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:55:09,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:09,476 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,103 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2022-02-20 23:55:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-02-20 23:55:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-02-20 23:55:10,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 180 transitions. [2022-02-20 23:55:10,220 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:55:10,222 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:55:10,222 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:55:10,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:55:10,223 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 258 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:10,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 270 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:55:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 130. [2022-02-20 23:55:10,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:10,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,225 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,225 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,228 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2022-02-20 23:55:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2022-02-20 23:55:10,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:10,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:10,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 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 184 states. [2022-02-20 23:55:10,228 INFO L87 Difference]: Start difference. First operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 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 184 states. [2022-02-20 23:55:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,230 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2022-02-20 23:55:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2022-02-20 23:55:10,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:10,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:10,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:10,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-02-20 23:55:10,233 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 16 [2022-02-20 23:55:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:10,233 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-02-20 23:55:10,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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:55:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:55:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:55:10,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:10,234 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] [2022-02-20 23:55:10,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:55:10,234 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -926362969, now seen corresponding path program 1 times [2022-02-20 23:55:10,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:10,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682048019] [2022-02-20 23:55:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:10,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {5897#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); {5897#true} is VALID [2022-02-20 23:55:10,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {5897#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {5897#true} is VALID [2022-02-20 23:55:10,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {5897#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {5897#true} is VALID [2022-02-20 23:55:10,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {5897#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {5897#true} is VALID [2022-02-20 23:55:10,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {5897#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {5897#true} is VALID [2022-02-20 23:55:10,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {5897#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: L1010 {5899#(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:55:10,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {5899#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {5899#(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:55:10,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {5899#(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; {5899#(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:55:10,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {5899#(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; {5899#(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:55:10,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {5899#(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; {5899#(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:55:10,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {5899#(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; {5900#(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:55:10,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {5900#(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); {5900#(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:55:10,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {5900#(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; {5900#(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:55:10,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {5900#(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~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {5900#(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:55:10,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {5900#(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~mem9#1);havoc main_#t~mem9#1; {5900#(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:55:10,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#(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; {5900#(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:55:10,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#(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); {5900#(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:55:10,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {5900#(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~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {5900#(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:55:10,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#(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~mem10#1);havoc main_#t~mem10#1; {5900#(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:55:10,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {5901#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} is VALID [2022-02-20 23:55:10,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {5901#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {5902#(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:55:10,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {5902#(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); {5898#false} is VALID [2022-02-20 23:55:10,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {5898#false} assume !(1 == #valid[main_~end~0#1.base]); {5898#false} is VALID [2022-02-20 23:55:10,319 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:55:10,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:10,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682048019] [2022-02-20 23:55:10,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682048019] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:10,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821964160] [2022-02-20 23:55:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:10,373 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:55:10,401 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:55:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:10,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:55:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:10,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:10,528 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:55:10,533 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:55:10,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:10,584 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:55:10,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:10,591 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:55:10,816 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:55:10,823 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:55:10,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {5897#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); {5897#true} is VALID [2022-02-20 23:55:10,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {5897#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:10,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {5909#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {5909#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:10,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {5909#(= |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: L1006-1 {5909#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:10,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {5909#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {5919#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:10,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {5919#(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: L1010 {5923#(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:55:10,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {5923#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {5923#(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:55:10,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {5923#(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; {5923#(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:55:10,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {5923#(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; {5923#(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:55:10,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {5923#(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; {5923#(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:55:10,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {5923#(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; {5939#(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:55:10,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {5939#(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); {5939#(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:55:10,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {5939#(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; {5939#(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:55:10,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {5939#(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~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {5939#(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:55:10,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {5939#(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~mem9#1);havoc main_#t~mem9#1; {5939#(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:55:10,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {5939#(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; {5939#(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:55:10,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {5939#(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); {5939#(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:55:10,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {5939#(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~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {5939#(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:55:10,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {5939#(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~mem10#1);havoc main_#t~mem10#1; {5939#(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:55:10,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {5939#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {5967#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} is VALID [2022-02-20 23:55:10,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {5967#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {5971#(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:55:10,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {5971#(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); {5898#false} is VALID [2022-02-20 23:55:10,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {5898#false} assume !(1 == #valid[main_~end~0#1.base]); {5898#false} is VALID [2022-02-20 23:55:10,880 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:55:10,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:11,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {5898#false} assume !(1 == #valid[main_~end~0#1.base]); {5898#false} is VALID [2022-02-20 23:55:11,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {5902#(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); {5898#false} is VALID [2022-02-20 23:55:11,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {5901#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {5902#(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:55:11,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {5901#(and (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |ULTIMATE.start_main_~null~0#1.offset|))} is VALID [2022-02-20 23:55:11,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#(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~mem10#1);havoc main_#t~mem10#1; {5900#(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:55:11,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {5900#(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~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {5900#(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:55:11,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#(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); {5900#(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:55:11,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#(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; {5900#(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:55:11,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {5900#(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~mem9#1);havoc main_#t~mem9#1; {5900#(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:55:11,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {5900#(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~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {5900#(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:55:11,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {5900#(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; {5900#(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:55:11,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {5900#(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); {5900#(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:55:11,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {5899#(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; {5900#(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:55:11,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {5899#(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; {5899#(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:55:11,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {5899#(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; {5899#(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:55:11,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {5899#(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; {5899#(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:55:11,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {5899#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {5899#(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:55:11,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {5897#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: L1010 {5899#(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:55:11,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {5897#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {5897#true} is VALID [2022-02-20 23:55:11,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {5897#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {5897#true} is VALID [2022-02-20 23:55:11,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {5897#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {5897#true} is VALID [2022-02-20 23:55:11,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {5897#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {5897#true} is VALID [2022-02-20 23:55:11,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {5897#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); {5897#true} is VALID [2022-02-20 23:55:11,056 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:55:11,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821964160] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:11,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:11,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-02-20 23:55:11,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572309684] [2022-02-20 23:55:11,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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 23 [2022-02-20 23:55:11,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:11,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:11,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:55:11,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:55:11,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:11,092 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,928 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-02-20 23:55:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:55:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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 23 [2022-02-20 23:55:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-02-20 23:55:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-02-20 23:55:11,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 177 transitions. [2022-02-20 23:55:12,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,065 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:55:12,065 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:55:12,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:55:12,066 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 298 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:12,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 296 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:55:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 137. [2022-02-20 23:55:12,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:12,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,068 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,069 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,071 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-02-20 23:55:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2022-02-20 23:55:12,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:55:12,071 INFO L87 Difference]: Start difference. First operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:55:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,073 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2022-02-20 23:55:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2022-02-20 23:55:12,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:12,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2022-02-20 23:55:12,076 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 23 [2022-02-20 23:55:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:12,076 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2022-02-20 23:55:12,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2022-02-20 23:55:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:55:12,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:12,077 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] [2022-02-20 23:55:12,095 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:55:12,291 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,SelfDestructingSolverStorable10 [2022-02-20 23:55:12,291 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -968381222, now seen corresponding path program 1 times [2022-02-20 23:55:12,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:12,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125350443] [2022-02-20 23:55:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:12,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {6733#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); {6733#true} is VALID [2022-02-20 23:55:12,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {6733#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {6733#true} is VALID [2022-02-20 23:55:12,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {6733#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {6733#true} is VALID [2022-02-20 23:55:12,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {6733#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {6733#true} is VALID [2022-02-20 23:55:12,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {6733#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {6733#true} is VALID [2022-02-20 23:55:12,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6733#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: L1010 {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {6733#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {6733#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {6733#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {6733#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {6733#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; {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {6733#true} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {6733#true} is VALID [2022-02-20 23:55:12,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {6733#true} goto; {6733#true} is VALID [2022-02-20 23:55:12,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {6733#true} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {6735#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:12,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {6735#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {6736#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:12,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {6736#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {6736#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:12,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {6736#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |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); {6736#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:12,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {6736#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {6737#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 23:55:12,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {6737#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume ~unnamed1~0~RED == main_#t~mem10#1;havoc main_#t~mem10#1; {6734#false} is VALID [2022-02-20 23:55:12,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {6734#false} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1048 {6734#false} is VALID [2022-02-20 23:55:12,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {6734#false} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {6734#false} is VALID [2022-02-20 23:55:12,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {6734#false} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {6734#false} is VALID [2022-02-20 23:55:12,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {6734#false} assume !false; {6734#false} is VALID [2022-02-20 23:55:12,430 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:55:12,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:12,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125350443] [2022-02-20 23:55:12,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125350443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:12,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:12,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:12,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995716930] [2022-02-20 23:55:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:55:12,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:12,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:12,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:12,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:12,446 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,773 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-02-20 23:55:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:55:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-02-20 23:55:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-02-20 23:55:12,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 117 transitions. [2022-02-20 23:55:12,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,850 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:55:12,850 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:55:12,850 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:55:12,851 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:12,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 296 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:55:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2022-02-20 23:55:12,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:12,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,853 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,853 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,854 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-02-20 23:55:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-02-20 23:55:12,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 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 141 states. [2022-02-20 23:55:12,855 INFO L87 Difference]: Start difference. First operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 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 141 states. [2022-02-20 23:55:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,857 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2022-02-20 23:55:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-02-20 23:55:12,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:12,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-02-20 23:55:12,859 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 23 [2022-02-20 23:55:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:12,859 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-02-20 23:55:12,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-02-20 23:55:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:55:12,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:12,860 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] [2022-02-20 23:55:12,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:55:12,860 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1747136957, now seen corresponding path program 1 times [2022-02-20 23:55:12,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:12,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140638620] [2022-02-20 23:55:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:12,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {7301#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); {7301#true} is VALID [2022-02-20 23:55:12,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {7301#true} is VALID [2022-02-20 23:55:12,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {7301#true} is VALID [2022-02-20 23:55:12,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {7301#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {7301#true} is VALID [2022-02-20 23:55:12,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {7301#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#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: L1010 {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {7301#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(8); {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {7301#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: L1019 {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {7301#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7301#true} is VALID [2022-02-20 23:55:12,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {7301#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: L1020 {7301#true} is VALID [2022-02-20 23:55:12,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {7301#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7301#true} is VALID [2022-02-20 23:55:12,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {7301#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: L1021 {7301#true} is VALID [2022-02-20 23:55:12,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {7301#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {7301#true} is VALID [2022-02-20 23:55:12,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {7301#true} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {7301#true} is VALID [2022-02-20 23:55:12,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {7301#true} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1029 {7301#true} is VALID [2022-02-20 23:55:12,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {7301#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8); {7303#(= (select |#valid| |ULTIMATE.start_main_#t~malloc7#1.base|) 1)} is VALID [2022-02-20 23:55:12,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {7303#(= (select |#valid| |ULTIMATE.start_main_#t~malloc7#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1030 {7304#(= (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:55:12,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {7304#(= (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~malloc7#1.base, main_#t~malloc7#1.offset; {7304#(= (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:55:12,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {7304#(= (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~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1031 {7305#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:55:12,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {7305#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7306#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:12,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {7306#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {7302#false} is VALID [2022-02-20 23:55:12,918 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:55:12,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:12,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140638620] [2022-02-20 23:55:12,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140638620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:12,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:12,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:12,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777285299] [2022-02-20 23:55:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:55:12,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:12,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:12,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:12,935 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,301 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-02-20 23:55:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:55:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:55:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:55:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:55:13,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 110 transitions. [2022-02-20 23:55:13,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:13,380 INFO L225 Difference]: With dead ends: 136 [2022-02-20 23:55:13,380 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 23:55:13,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:13,381 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:13,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 261 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 23:55:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-02-20 23:55:13,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:13,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,386 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,386 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,387 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-02-20 23:55:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-02-20 23:55:13,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:13,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:13,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 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 136 states. [2022-02-20 23:55:13,388 INFO L87 Difference]: Start difference. First operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 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 136 states. [2022-02-20 23:55:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,389 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-02-20 23:55:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-02-20 23:55:13,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:13,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:13,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:13,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-02-20 23:55:13,392 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 24 [2022-02-20 23:55:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:13,392 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-02-20 23:55:13,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-02-20 23:55:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:55:13,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:13,393 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] [2022-02-20 23:55:13,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:55:13,393 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1747136958, now seen corresponding path program 1 times [2022-02-20 23:55:13,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:13,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339308711] [2022-02-20 23:55:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:13,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {7860#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); {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {7860#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {7860#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {7860#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {7860#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {7860#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: L1010 {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {7860#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {7860#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7860#true} is VALID [2022-02-20 23:55:13,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {7860#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {7860#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(8); {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {7860#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: L1019 {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {7860#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {7860#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: L1020 {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {7860#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {7860#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: L1021 {7860#true} is VALID [2022-02-20 23:55:13,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {7860#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {7860#true} is VALID [2022-02-20 23:55:13,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {7860#true} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {7860#true} is VALID [2022-02-20 23:55:13,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {7860#true} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1029 {7860#true} is VALID [2022-02-20 23:55:13,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {7860#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8); {7862#(and (= 8 (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0))} is VALID [2022-02-20 23:55:13,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {7862#(and (= 8 (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1030 {7863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:13,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {7863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {7863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:13,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {7863#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1031 {7864#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 8))} is VALID [2022-02-20 23:55:13,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {7864#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 8))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7865#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:55:13,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {7865#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (- 8)) 0))} assume !(4 + main_~end~0#1.offset <= #length[main_~end~0#1.base] && 0 <= main_~end~0#1.offset); {7861#false} is VALID [2022-02-20 23:55:13,472 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:55:13,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:13,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339308711] [2022-02-20 23:55:13,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339308711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:13,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:13,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:13,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966597062] [2022-02-20 23:55:13,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:55:13,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:13,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:13,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:13,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:13,488 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,855 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-02-20 23:55:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:55:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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:55:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:55:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:55:13,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 110 transitions. [2022-02-20 23:55:13,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:13,925 INFO L225 Difference]: With dead ends: 133 [2022-02-20 23:55:13,925 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 23:55:13,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:13,926 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:13,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 315 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 23:55:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2022-02-20 23:55:13,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:13,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,927 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,928 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,929 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-02-20 23:55:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-02-20 23:55:13,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:13,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:13,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 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 133 states. [2022-02-20 23:55:13,930 INFO L87 Difference]: Start difference. First operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 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 133 states. [2022-02-20 23:55:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,932 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-02-20 23:55:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-02-20 23:55:13,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:13,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:13,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:13,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-02-20 23:55:13,934 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 24 [2022-02-20 23:55:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:13,934 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-02-20 23:55:13,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-02-20 23:55:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:55:13,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:13,935 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] [2022-02-20 23:55:13,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:55:13,935 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:13,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash 59031534, now seen corresponding path program 1 times [2022-02-20 23:55:13,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:13,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140715628] [2022-02-20 23:55:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:14,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {8397#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); {8397#true} is VALID [2022-02-20 23:55:14,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {8399#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:14,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {8399#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {8399#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:14,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {8399#(= |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: L1006-1 {8399#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:14,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {8399#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {8400#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {8400#(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: L1010 {8401#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {8401#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {8402#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {8402#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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| 4))) (= |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; {8403#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (<= (+ |ULTIMATE.start_main_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {8403#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (<= (+ |ULTIMATE.start_main_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8403#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (<= (+ |ULTIMATE.start_main_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {8403#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (<= (+ |ULTIMATE.start_main_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {8404#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (not (<= (+ |ULTIMATE.start_main_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {8404#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (not (<= (+ |ULTIMATE.start_main_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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: L1019 {8405#(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_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {8405#(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_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8405#(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_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {8405#(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_~list~0#1.offset| 1) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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: L1020 {8406#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:55:14,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {8406#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {8407#(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| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {8408#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {8408#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8408#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {8408#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8408#(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| 4))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {8408#(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| 4))) (= |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; {8409#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {8409#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~null~0#1.offset| 0) (= |ULTIMATE.start_main_~end~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); {8410#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {8410#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} goto; {8410#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:14,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {8410#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {8411#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:14,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {8411#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {8398#false} is VALID [2022-02-20 23:55:14,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {8398#false} assume !false; {8398#false} is VALID [2022-02-20 23:55:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:14,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:14,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140715628] [2022-02-20 23:55:14,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140715628] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:14,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774398972] [2022-02-20 23:55:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:14,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:14,274 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:55:14,276 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:55:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:14,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:55:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:14,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:14,391 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:55:14,408 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:55:14,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:14,468 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:55:14,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:14,528 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:55:14,537 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:55:14,600 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 16 treesize of output 8 [2022-02-20 23:55:14,644 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 16 treesize of output 18 [2022-02-20 23:55:14,686 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 16 treesize of output 18 [2022-02-20 23:55:14,745 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:55:14,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {8397#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); {8397#true} is VALID [2022-02-20 23:55:14,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {8397#true} is VALID [2022-02-20 23:55:14,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {8397#true} is VALID [2022-02-20 23:55:14,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {8397#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {8397#true} is VALID [2022-02-20 23:55:14,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {8397#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {8427#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:14,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {8427#(= (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: L1010 {8427#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:14,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {8427#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {8434#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:14,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {8434#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8438#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:14,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {8438#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8438#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:14,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {8438#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {8445#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:14,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {8445#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#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: L1019 {8449#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:14,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {8449#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8449#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:14,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {8449#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} 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: L1020 {8456#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:55:14,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {8456#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:14,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:14,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:14,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:14,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {8460#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:14,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} 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; {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:14,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |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); {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:14,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:14,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {8411#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:14,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {8411#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {8398#false} is VALID [2022-02-20 23:55:14,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {8398#false} assume !false; {8398#false} is VALID [2022-02-20 23:55:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:14,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:14,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:14,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2022-02-20 23:55:14,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:14,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:15,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_56| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int) (v_ArrVal_533 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)))) is different from false [2022-02-20 23:55:15,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:15,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:15,194 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-02-20 23:55:15,221 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 36 treesize of output 24 [2022-02-20 23:55:15,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-02-20 23:55:15,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {8398#false} assume !false; {8398#false} is VALID [2022-02-20 23:55:15,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {8411#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {8398#false} is VALID [2022-02-20 23:55:15,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {8411#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:15,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:15,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |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); {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:15,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} 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; {8483#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:15,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:15,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:15,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {8473#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:15,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} is VALID [2022-02-20 23:55:15,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} is VALID [2022-02-20 23:55:15,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} 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: L1021 {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} is VALID [2022-02-20 23:55:15,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {8536#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8523#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} is VALID [2022-02-20 23:55:15,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} 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: L1020 {8536#(forall ((v_ArrVal_533 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))} is VALID [2022-02-20 23:55:15,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {8540#(forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8540#(forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:15,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {8547#(forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} 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: L1019 {8540#(forall ((v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:15,258 WARN L290 TraceCheckUtils]: 9: Hoare triple {8551#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)) (forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {8547#(forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is UNKNOWN [2022-02-20 23:55:15,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {8551#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)) (forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8551#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)) (forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))))} is VALID [2022-02-20 23:55:15,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {8558#(forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_56| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int) (v_ArrVal_533 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~list~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |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; {8551#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)) (forall ((v_ArrVal_528 Int) (v_ArrVal_533 (Array Int Int))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))))} is VALID [2022-02-20 23:55:15,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {8562#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {8558#(forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_56| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int) (v_ArrVal_533 (Array Int Int))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0)) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~list~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_56| v_ArrVal_528)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_533) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_56| |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:15,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {8562#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 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: L1010 {8562#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:15,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {8397#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {8562#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:15,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {8397#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {8397#true} is VALID [2022-02-20 23:55:15,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {8397#true} is VALID [2022-02-20 23:55:15,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {8397#true} is VALID [2022-02-20 23:55:15,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {8397#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); {8397#true} is VALID [2022-02-20 23:55:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:15,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774398972] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:15,262 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:15,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-02-20 23:55:15,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470267331] [2022-02-20 23:55:15,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:15,265 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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:55:15,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:15,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 60 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:15,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-20 23:55:15,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-20 23:55:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=541, Unknown=5, NotChecked=260, Total=930 [2022-02-20 23:55:15,326 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:17,945 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2022-02-20 23:55:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 23:55:17,945 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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:55:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 331 transitions. [2022-02-20 23:55:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 331 transitions. [2022-02-20 23:55:17,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 331 transitions. [2022-02-20 23:55:18,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 330 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:18,263 INFO L225 Difference]: With dead ends: 348 [2022-02-20 23:55:18,263 INFO L226 Difference]: Without dead ends: 348 [2022-02-20 23:55:18,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=1051, Unknown=5, NotChecked=370, Total=1722 [2022-02-20 23:55:18,264 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 407 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1330 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:18,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 827 Invalid, 2502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1099 Invalid, 0 Unknown, 1330 Unchecked, 0.9s Time] [2022-02-20 23:55:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-02-20 23:55:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 151. [2022-02-20 23:55:18,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:18,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,267 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,267 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,286 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2022-02-20 23:55:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 376 transitions. [2022-02-20 23:55:18,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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 348 states. [2022-02-20 23:55:18,287 INFO L87 Difference]: Start difference. First operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 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 348 states. [2022-02-20 23:55:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,291 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2022-02-20 23:55:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 376 transitions. [2022-02-20 23:55:18,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:18,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-02-20 23:55:18,293 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 26 [2022-02-20 23:55:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:18,293 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-02-20 23:55:18,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-02-20 23:55:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:55:18,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:18,294 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:55:18,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:18,494 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,SelfDestructingSolverStorable14 [2022-02-20 23:55:18,495 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash 500584872, now seen corresponding path program 1 times [2022-02-20 23:55:18,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:18,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107997477] [2022-02-20 23:55:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {9804#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); {9804#true} is VALID [2022-02-20 23:55:18,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {9804#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {9804#true} is VALID [2022-02-20 23:55:18,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {9804#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {9804#true} is VALID [2022-02-20 23:55:18,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {9804#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {9804#true} is VALID [2022-02-20 23:55:18,543 INFO L290 TraceCheckUtils]: 4: Hoare triple {9804#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {9806#(not (<= |#StackHeapBarrier| |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: L1010 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {9806#(not (<= |#StackHeapBarrier| |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; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {9806#(not (<= |#StackHeapBarrier| |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; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} goto; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} goto; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem14#1 := read~int(main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1059 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~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; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume 0 == main_~list~0#1.offset; {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:18,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {9806#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~list~0#1.base|))} assume !(main_~list~0#1.base < #StackHeapBarrier); {9805#false} is VALID [2022-02-20 23:55:18,550 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:55:18,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:18,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107997477] [2022-02-20 23:55:18,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107997477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:18,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:18,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:18,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472893914] [2022-02-20 23:55:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:18,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,567 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:55:18,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:18,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:18,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:18,568 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,648 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-02-20 23:55:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:55:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 23:55:18,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 23:55:18,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:18,723 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:55:18,723 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:55:18,723 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:55:18,724 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:18,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 101 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:55:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-02-20 23:55:18,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:18,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,726 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,726 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,728 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-02-20 23:55:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-02-20 23:55:18,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:55:18,729 INFO L87 Difference]: Start difference. First operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:55:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,730 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-02-20 23:55:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-02-20 23:55:18,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:18,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 128 states have (on average 1.2890625) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-02-20 23:55:18,733 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-02-20 23:55:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:18,733 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-02-20 23:55:18,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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:55:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-02-20 23:55:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:55:18,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:18,734 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:55:18,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:55:18,734 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1324652277, now seen corresponding path program 1 times [2022-02-20 23:55:18,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:18,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832309765] [2022-02-20 23:55:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:18,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {10417#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); {10417#true} is VALID [2022-02-20 23:55:18,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {10417#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {10417#true} is VALID [2022-02-20 23:55:18,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {10417#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {10417#true} is VALID [2022-02-20 23:55:18,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {10417#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {10417#true} is VALID [2022-02-20 23:55:18,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {10417#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {10417#true} is VALID [2022-02-20 23:55:18,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {10417#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: L1010 {10417#true} is VALID [2022-02-20 23:55:18,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {10417#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} 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; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} goto; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} goto; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} assume !!(main_~null~0#1.base != main_~list~0#1.base || main_~null~0#1.offset != main_~list~0#1.offset); {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} is VALID [2022-02-20 23:55:18,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {10419#(not (= (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~RED))} SUMMARY for call main_#t~mem14#1 := read~int(main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1059 {10420#(not (= ~unnamed1~0~RED |ULTIMATE.start_main_#t~mem14#1|))} is VALID [2022-02-20 23:55:18,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {10420#(not (= ~unnamed1~0~RED |ULTIMATE.start_main_#t~mem14#1|))} assume ~unnamed1~0~RED == main_#t~mem14#1;havoc main_#t~mem14#1; {10418#false} is VALID [2022-02-20 23:55:18,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {10418#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1061 {10418#false} is VALID [2022-02-20 23:55:18,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {10418#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; {10418#false} is VALID [2022-02-20 23:55:18,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {10418#false} assume 0 == main_~list~0#1.offset; {10418#false} is VALID [2022-02-20 23:55:18,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {10418#false} assume main_~list~0#1.base < #StackHeapBarrier; {10418#false} is VALID [2022-02-20 23:55:18,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {10418#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); {10418#false} is VALID [2022-02-20 23:55:18,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {10418#false} assume !(1 == #valid[main_~end~0#1.base]); {10418#false} is VALID [2022-02-20 23:55:18,792 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:55:18,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:18,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832309765] [2022-02-20 23:55:18,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832309765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:18,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:18,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:55:18,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697720889] [2022-02-20 23:55:18,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:18,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:18,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:18,811 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:55:18,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:18,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:18,812 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:19,026 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-02-20 23:55:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-02-20 23:55:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-02-20 23:55:19,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-02-20 23:55:19,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:19,135 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:55:19,135 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:55:19,135 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:55:19,136 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:19,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:55:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2022-02-20 23:55:19,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:19,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 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:55:19,139 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 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:55:19,139 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 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:55:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:19,143 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-02-20 23:55:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2022-02-20 23:55:19,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:19,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:19,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 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 160 states. [2022-02-20 23:55:19,144 INFO L87 Difference]: Start difference. First operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 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 160 states. [2022-02-20 23:55:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:19,145 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-02-20 23:55:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2022-02-20 23:55:19,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:19,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:19,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:19,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.282442748091603) internal successors, (168), 154 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:55:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2022-02-20 23:55:19,163 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 31 [2022-02-20 23:55:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:19,163 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2022-02-20 23:55:19,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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:55:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2022-02-20 23:55:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:55:19,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:19,164 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] [2022-02-20 23:55:19,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:55:19,164 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash 797716084, now seen corresponding path program 1 times [2022-02-20 23:55:19,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:19,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077983825] [2022-02-20 23:55:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {11060#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); {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {11060#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {11060#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {11060#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {11060#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {11060#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: L1010 {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {11060#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {11060#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {11060#true} is VALID [2022-02-20 23:55:19,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {11060#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {11060#true} is VALID [2022-02-20 23:55:19,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {11060#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {11060#true} is VALID [2022-02-20 23:55:19,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {11060#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; {11062#(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:55:19,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {11062#(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); {11062#(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:55:19,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {11062#(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; {11062#(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:55:19,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {11062#(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~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {11062#(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:55:19,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {11062#(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~mem9#1);havoc main_#t~mem9#1; {11062#(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:55:19,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {11062#(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; {11062#(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:55:19,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {11062#(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); {11062#(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:55:19,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {11062#(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~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {11062#(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:55:19,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {11062#(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~mem10#1);havoc main_#t~mem10#1; {11062#(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:55:19,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {11062#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {11063#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#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:55:19,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {11063#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_#t~mem13#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~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {11064#(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:55:19,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {11064#(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); {11065#(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:55:19,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {11065#(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); {11065#(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:55:19,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {11065#(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_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1059 {11065#(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:55:19,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {11065#(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; {11065#(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:55:19,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {11065#(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_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {11066#(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:55:19,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {11066#(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; {11067#(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:55:19,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {11067#(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; {11067#(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:55:19,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {11067#(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; {11067#(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:55:19,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {11067#(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; {11068#(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:55:19,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {11068#(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); {11061#false} is VALID [2022-02-20 23:55:19,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {11061#false} assume !(1 == #valid[main_~list~0#1.base]); {11061#false} is VALID [2022-02-20 23:55:19,304 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:55:19,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:19,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077983825] [2022-02-20 23:55:19,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077983825] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:19,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227962175] [2022-02-20 23:55:19,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:19,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:19,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:19,305 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:55:19,320 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:55:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:19,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:55:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:19,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:19,432 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:55:19,435 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:55:19,474 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:55:19,474 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:55:19,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:19,480 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:55:19,642 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:55:19,652 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:55:19,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {11060#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); {11060#true} is VALID [2022-02-20 23:55:19,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {11060#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {11075#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:19,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {11075#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {11075#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:19,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {11075#(= |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: L1006-1 {11075#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:19,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {11075#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {11075#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:19,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {11075#(= |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: L1010 {11088#(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:55:19,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {11088#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {11088#(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:55:19,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {11088#(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; {11088#(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:55:19,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {11088#(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; {11088#(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:55:19,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {11088#(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; {11088#(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:55:19,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {11088#(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; {11088#(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:55:19,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {11088#(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); {11088#(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:55:19,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {11088#(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; {11088#(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:55:19,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {11088#(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~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {11088#(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:55:19,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {11088#(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~mem9#1);havoc main_#t~mem9#1; {11088#(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:55:19,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {11088#(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; {11088#(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:55:19,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {11088#(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); {11088#(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:55:19,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {11088#(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~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {11088#(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:55:19,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {11088#(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~mem10#1);havoc main_#t~mem10#1; {11088#(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:55:19,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {11088#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {11088#(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:55:19,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {11088#(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~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {11088#(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:55:19,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {11088#(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); {11088#(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:55:19,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {11088#(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); {11088#(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:55:19,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {11088#(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_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1059 {11088#(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:55:19,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {11088#(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; {11088#(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:55:19,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {11088#(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_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {11149#(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:55:19,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {11149#(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; {11153#(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:55:19,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {11153#(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; {11153#(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:55:19,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {11153#(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; {11153#(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:55:19,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {11153#(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; {11163#(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:55:19,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {11163#(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); {11061#false} is VALID [2022-02-20 23:55:19,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {11061#false} assume !(1 == #valid[main_~list~0#1.base]); {11061#false} is VALID [2022-02-20 23:55:19,723 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:55:19,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:19,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {11061#false} assume !(1 == #valid[main_~list~0#1.base]); {11061#false} is VALID [2022-02-20 23:55:19,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {11068#(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); {11061#false} is VALID [2022-02-20 23:55:19,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {11067#(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; {11068#(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:55:19,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {11067#(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; {11067#(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:55:19,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {11067#(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; {11067#(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:55:19,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {11066#(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; {11067#(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:55:19,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {11065#(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_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {11066#(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:55:19,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {11065#(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; {11065#(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:55:19,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {11065#(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_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1059 {11065#(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:55:19,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {11065#(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); {11065#(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:55:19,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {11065#(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); {11065#(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:55:19,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {11065#(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~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {11065#(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:55:19,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {11065#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {11065#(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:55:19,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {11065#(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~mem10#1);havoc main_#t~mem10#1; {11065#(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:55:19,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {11065#(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~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {11065#(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:55:19,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {11065#(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); {11065#(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:55:19,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {11065#(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; {11065#(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:55:19,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {11065#(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~mem9#1);havoc main_#t~mem9#1; {11065#(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:55:19,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {11065#(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~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {11065#(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:55:19,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {11065#(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; {11065#(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:55:19,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {11065#(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); {11065#(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:55:19,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {11065#(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; {11065#(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:55:19,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {11065#(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; {11065#(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:55:19,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {11065#(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; {11065#(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:55:19,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {11065#(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; {11065#(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:55:19,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {11065#(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, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {11065#(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:55:19,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {11060#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: L1010 {11065#(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:55:19,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {11060#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {11060#true} is VALID [2022-02-20 23:55:19,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {11060#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {11060#true} is VALID [2022-02-20 23:55:19,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {11060#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {11060#true} is VALID [2022-02-20 23:55:19,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {11060#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {11060#true} is VALID [2022-02-20 23:55:19,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {11060#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); {11060#true} is VALID [2022-02-20 23:55:19,896 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:55:19,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227962175] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:19,896 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:19,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2022-02-20 23:55:19,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770070816] [2022-02-20 23:55:19,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 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:55:19,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:19,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:19,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:19,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:55:19,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:55:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:55:19,954 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:21,219 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2022-02-20 23:55:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:55:21,219 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 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:55:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2022-02-20 23:55:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2022-02-20 23:55:21,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 184 transitions. [2022-02-20 23:55:21,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:21,373 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:55:21,373 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:55:21,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:55:21,374 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 236 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:21,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 512 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:55:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:55:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2022-02-20 23:55:21,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:21,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,376 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,376 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:21,378 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2022-02-20 23:55:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2022-02-20 23:55:21,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:21,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:21,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 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 209 states. [2022-02-20 23:55:21,379 INFO L87 Difference]: Start difference. First operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 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 209 states. [2022-02-20 23:55:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:21,381 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2022-02-20 23:55:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2022-02-20 23:55:21,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:21,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:21,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:21,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-02-20 23:55:21,390 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 32 [2022-02-20 23:55:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:21,390 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-02-20 23:55:21,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-02-20 23:55:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:55:21,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:21,390 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:55:21,416 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:55:21,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 23:55:21,607 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:21,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:21,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1040605566, now seen corresponding path program 1 times [2022-02-20 23:55:21,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:21,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189611465] [2022-02-20 23:55:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:21,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {12074#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); {12074#true} is VALID [2022-02-20 23:55:21,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {12074#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {12076#(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: L1006-1 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {12076#(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: L1010 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {12076#(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; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {12076#(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; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {12076#(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); {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} goto; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} goto; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {12076#(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); {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {12076#(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); {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {12076#(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); {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} SUMMARY for call main_#t~mem14#1 := read~int(main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1059 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {12076#(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_~list~0#1.base, main_~list~0#1.offset, 4); srcloc: L1068 {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {12076#(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; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume 0 == main_~list~0#1.offset; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume main_~list~0#1.base < #StackHeapBarrier; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {12076#(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; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {12076#(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); {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume 0 == main_~null~0#1.offset; {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:21,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {12076#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~null~0#1.base|))} assume !(main_~null~0#1.base < #StackHeapBarrier); {12075#false} is VALID [2022-02-20 23:55:21,656 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:55:21,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:21,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189611465] [2022-02-20 23:55:21,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189611465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:21,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:21,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:21,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526480703] [2022-02-20 23:55:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:21,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,676 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:55:21,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:21,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:21,677 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:21,741 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:55:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-20 23:55:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-20 23:55:21,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-20 23:55:21,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:21,809 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:55:21,809 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:55:21,810 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:55:21,810 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:21,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 73 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:55:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-02-20 23:55:21,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:21,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 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:55:21,813 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 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:55:21,814 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 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:55:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:21,817 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:55:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:55:21,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:21,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:21,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 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 165 states. [2022-02-20 23:55:21,818 INFO L87 Difference]: Start difference. First operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 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 165 states. [2022-02-20 23:55:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:21,819 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:55:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:55:21,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:21,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:21,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:21,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.2605633802816902) internal successors, (179), 164 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:55:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2022-02-20 23:55:21,823 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 33 [2022-02-20 23:55:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:21,823 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2022-02-20 23:55:21,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 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:55:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:55:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:55:21,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:21,824 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-02-20 23:55:21,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:55:21,824 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:21,825 INFO L85 PathProgramCache]: Analyzing trace with hash 248148312, now seen corresponding path program 1 times [2022-02-20 23:55:21,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:21,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602447934] [2022-02-20 23:55:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:21,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {12739#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); {12739#true} is VALID [2022-02-20 23:55:21,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {12739#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {12739#true} is VALID [2022-02-20 23:55:21,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {12739#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {12739#true} is VALID [2022-02-20 23:55:21,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {12739#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {12739#true} is VALID [2022-02-20 23:55:21,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {12739#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {12739#true} is VALID [2022-02-20 23:55:21,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {12739#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: L1010 {12741#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:21,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {12741#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {12741#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:21,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {12741#(= (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; {12742#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:21,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {12742#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12742#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:21,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {12742#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {12743#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:21,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {12743#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} 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: L1019 {12744#(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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:21,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {12744#(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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12744#(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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:21,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {12744#(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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |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: L1020 {12745#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:55:21,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {12745#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12746#(and (= (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|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:21,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {12746#(and (= (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|) (not (= |ULTIMATE.start_main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {12747#(and (= (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|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:21,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {12747#(and (= (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|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {12747#(and (= (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|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:21,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {12747#(and (= (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|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {12747#(and (= (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|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:21,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {12747#(and (= (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|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:55:21,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:55:21,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:55:21,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} 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; {12749#(= (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:55:21,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12749#(= (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:55:21,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} goto; {12749#(= (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:55:21,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {12749#(= (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 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {12749#(= (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:55:21,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {12749#(= (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:55:21,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} goto; {12749#(= (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:55:21,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12749#(= (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:55:21,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {12749#(= (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 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {12749#(= (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:55:21,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {12749#(= (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:55:21,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {12749#(= (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~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {12750#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:55:21,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {12750#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:21,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:21,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {12740#false} is VALID [2022-02-20 23:55:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:21,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:21,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602447934] [2022-02-20 23:55:21,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602447934] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:21,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442445762] [2022-02-20 23:55:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:21,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:21,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:21,959 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:55:21,960 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:55:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:22,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:55:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:22,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:22,088 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:55:22,155 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:55:22,155 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 21 [2022-02-20 23:55:22,203 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:55:22,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:22,313 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 31 treesize of output 29 [2022-02-20 23:55:22,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:22,362 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:55:22,532 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:55:22,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {12739#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); {12739#true} is VALID [2022-02-20 23:55:22,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {12739#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {12739#true} is VALID [2022-02-20 23:55:22,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {12739#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {12739#true} is VALID [2022-02-20 23:55:22,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {12739#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {12739#true} is VALID [2022-02-20 23:55:22,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {12739#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {12767#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:22,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {12767#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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: L1010 {12767#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:22,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {12767#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {12767#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:22,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {12767#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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; {12777#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:22,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {12777#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12777#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:22,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {12777#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {12784#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) 1))} is VALID [2022-02-20 23:55:22,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {12784#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (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: L1019 {12788#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (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:55:22,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {12788#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (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; {12788#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (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:55:22,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {12788#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (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: L1020 {12795#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {12795#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} 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: L1021 {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {12799#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {12812#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {12812#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12812#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {12812#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12812#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:22,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {12812#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (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.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} 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; {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} goto; {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} goto; {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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:55:22,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {12822#(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_~end~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= (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~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {12850#(and (exists ((|ULTIMATE.start_main_~end~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|)))) (= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|)))} is VALID [2022-02-20 23:55:22,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {12850#(and (exists ((|ULTIMATE.start_main_~end~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|)))) (= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {12854#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~end~0#1.base_77| Int)) (and (not (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_~end~0#1.base_77|)) (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_77|) 1))))} is VALID [2022-02-20 23:55:22,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {12854#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~end~0#1.base_77| Int)) (and (not (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_~end~0#1.base_77|)) (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_77|) 1))))} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12854#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~end~0#1.base_77| Int)) (and (not (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_~end~0#1.base_77|)) (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_77|) 1))))} is VALID [2022-02-20 23:55:22,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {12854#(and (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~end~0#1.base_77| Int)) (and (not (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_~end~0#1.base_77|)) (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_77|) 1))))} assume !(1 == #valid[main_~end~0#1.base]); {12740#false} is VALID [2022-02-20 23:55:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:22,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:22,704 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-02-20 23:55:22,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_787) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-02-20 23:55:22,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:22,751 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-20 23:55:22,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:22,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 37 [2022-02-20 23:55:22,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-02-20 23:55:25,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !(1 == #valid[main_~end~0#1.base]); {12740#false} is VALID [2022-02-20 23:55:25,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:25,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {12750#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {12751#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1)} is VALID [2022-02-20 23:55:25,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {12749#(= (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~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {12750#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:55:25,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {12749#(= (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:55:25,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {12749#(= (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 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {12749#(= (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:55:25,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12749#(= (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:55:25,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} goto; {12749#(= (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:55:25,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {12749#(= (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:55:25,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {12749#(= (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 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {12749#(= (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:55:25,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} goto; {12749#(= (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:55:25,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {12749#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 1)} assume !!(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {12749#(= (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:55:25,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} 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; {12749#(= (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:55:25,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:55:25,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:55:25,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {12748#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1)} is VALID [2022-02-20 23:55:25,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:25,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:25,259 WARN L290 TraceCheckUtils]: 14: Hoare triple {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} 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: L1021 {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is UNKNOWN [2022-02-20 23:55:25,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {12919#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12906#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:25,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {12923#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~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: L1020 {12919#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:25,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {12923#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12923#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:25,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {12930#(or (forall ((v_arrayElimCell_25 Int)) (= (select |#valid| v_arrayElimCell_25) 1)) (forall ((v_arrayElimCell_24 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| v_arrayElimCell_24) 1)) (and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_24)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|)))))} 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: L1019 {12923#(forall ((v_ArrVal_787 (Array Int Int))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_787) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 1))} is VALID [2022-02-20 23:55:25,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {12934#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_8| Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_25) 1) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| v_arrayElimCell_24)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8|) 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_24) 1) (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| |ULTIMATE.start_main_~list~0#1.base|)))))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {12930#(or (forall ((v_arrayElimCell_25 Int)) (= (select |#valid| v_arrayElimCell_25) 1)) (forall ((v_arrayElimCell_24 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#valid| v_arrayElimCell_24) 1)) (and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| v_arrayElimCell_24)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|)))))} is VALID [2022-02-20 23:55:25,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {12934#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_8| Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_25) 1) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| v_arrayElimCell_24)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8|) 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_24) 1) (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| |ULTIMATE.start_main_~list~0#1.base|)))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12934#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_8| Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_25) 1) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| v_arrayElimCell_24)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8|) 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_24) 1) (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| |ULTIMATE.start_main_~list~0#1.base|)))))} is VALID [2022-02-20 23:55:25,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {12941#(or (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0)) (forall ((v_arrayElimCell_25 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~list~0#1.base| 1) v_arrayElimCell_25) 1)))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {12934#(forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_8| Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_25) 1) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| v_arrayElimCell_24)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8|) 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_8| 1) v_arrayElimCell_24) 1) (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_8| |ULTIMATE.start_main_~list~0#1.base|)))))} is VALID [2022-02-20 23:55:25,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {12941#(or (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0)) (forall ((v_arrayElimCell_25 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~list~0#1.base| 1) v_arrayElimCell_25) 1)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {12941#(or (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0)) (forall ((v_arrayElimCell_25 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~list~0#1.base| 1) v_arrayElimCell_25) 1)))} is VALID [2022-02-20 23:55:25,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {12941#(or (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0)) (forall ((v_arrayElimCell_25 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~list~0#1.base| 1) v_arrayElimCell_25) 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: L1010 {12941#(or (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0)) (forall ((v_arrayElimCell_25 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~list~0#1.base| 1) v_arrayElimCell_25) 1)))} is VALID [2022-02-20 23:55:25,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {12739#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {12941#(or (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0)) (forall ((v_arrayElimCell_25 Int)) (= (select (store |#valid| |ULTIMATE.start_main_~list~0#1.base| 1) v_arrayElimCell_25) 1)))} is VALID [2022-02-20 23:55:25,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {12739#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {12739#true} is VALID [2022-02-20 23:55:25,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {12739#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {12739#true} is VALID [2022-02-20 23:55:25,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {12739#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {12739#true} is VALID [2022-02-20 23:55:25,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {12739#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); {12739#true} is VALID [2022-02-20 23:55:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:25,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442445762] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:25,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:25,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-02-20 23:55:25,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186169273] [2022-02-20 23:55:25,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 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:55:25,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:25,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:27,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 74 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:27,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-20 23:55:27,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-20 23:55:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=8, NotChecked=102, Total=812 [2022-02-20 23:55:27,491 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:29,369 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2022-02-20 23:55:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:55:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 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:55:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-02-20 23:55:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-02-20 23:55:29,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 210 transitions. [2022-02-20 23:55:29,524 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:55:29,526 INFO L225 Difference]: With dead ends: 238 [2022-02-20 23:55:29,526 INFO L226 Difference]: Without dead ends: 238 [2022-02-20 23:55:29,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=8, NotChecked=122, Total=1122 [2022-02-20 23:55:29,527 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 429 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:29,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 614 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1004 Invalid, 0 Unknown, 672 Unchecked, 0.7s Time] [2022-02-20 23:55:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-20 23:55:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 178. [2022-02-20 23:55:29,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:29,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,530 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,530 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:29,532 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2022-02-20 23:55:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 257 transitions. [2022-02-20 23:55:29,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:29,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:29,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 0 states have call successors, (0), 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 238 states. [2022-02-20 23:55:29,533 INFO L87 Difference]: Start difference. First operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 0 states have call successors, (0), 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 238 states. [2022-02-20 23:55:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:29,536 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2022-02-20 23:55:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 257 transitions. [2022-02-20 23:55:29,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:29,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:29,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:29,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 177 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2022-02-20 23:55:29,538 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 33 [2022-02-20 23:55:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:29,539 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2022-02-20 23:55:29,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2022-02-20 23:55:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:55:29,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:29,540 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-02-20 23:55:29,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 23:55:29,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:29,755 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 248148313, now seen corresponding path program 1 times [2022-02-20 23:55:29,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:29,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614081382] [2022-02-20 23:55:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:29,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {13868#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); {13868#true} is VALID [2022-02-20 23:55:29,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {13868#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {13868#true} is VALID [2022-02-20 23:55:29,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {13868#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {13868#true} is VALID [2022-02-20 23:55:29,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {13868#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {13868#true} is VALID [2022-02-20 23:55:29,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {13868#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {13868#true} is VALID [2022-02-20 23:55:29,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {13868#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: L1010 {13870#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:29,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {13870#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {13870#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:29,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {13870#(= (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; {13871#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:29,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {13871#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13871#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:29,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {13871#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {13872#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 8) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:29,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {13872#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) 8) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} 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: L1019 {13873#(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|)) 8) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {13873#(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|)) 8) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {13873#(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|)) 8) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {13873#(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|)) 8) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} 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: L1020 {13874#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:55:29,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {13874#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:29,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:29,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:29,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:29,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {13875#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {13876#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {13876#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13876#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {13876#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {13876#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {13876#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |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_~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; {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~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); {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} goto; {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} goto; {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~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); {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:29,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {13877#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {13878#(and (= |ULTIMATE.start_main_#t~mem13#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)))} is VALID [2022-02-20 23:55:29,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {13878#(and (= |ULTIMATE.start_main_#t~mem13#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {13879#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:29,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {13879#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~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); {13879#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:29,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {13879#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) 8) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !(4 + (4 + main_~end~0#1.offset) <= #length[main_~end~0#1.base] && 0 <= 4 + main_~end~0#1.offset); {13869#false} is VALID [2022-02-20 23:55:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:29,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:29,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614081382] [2022-02-20 23:55:29,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614081382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:29,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881938677] [2022-02-20 23:55:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:29,960 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55:29,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:55:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:30,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-20 23:55:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:30,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:30,118 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:55:30,211 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:55:30,221 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:30,221 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:55:30,289 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:55:30,303 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:55:30,458 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:55:30,458 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 14 treesize of output 20 [2022-02-20 23:55:30,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-02-20 23:55:30,486 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:30,487 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 31 treesize of output 29 [2022-02-20 23:55:30,576 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:30,577 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:55:30,581 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:55:30,806 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:55:30,814 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:55:30,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {13868#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); {13868#true} is VALID [2022-02-20 23:55:30,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {13868#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {13868#true} is VALID [2022-02-20 23:55:30,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {13868#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {13868#true} is VALID [2022-02-20 23:55:30,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {13868#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {13868#true} is VALID [2022-02-20 23:55:30,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {13868#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {13895#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {13895#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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: L1010 {13895#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {13895#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {13895#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {13895#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |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; {13905#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {13905#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13905#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {13905#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {13912#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {13912#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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: L1019 {13916#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {13916#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {13916#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {13916#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.base| |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$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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: L1020 {13923#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {13923#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1.base|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {13927#(and (<= 8 (select |#length| (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_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) |ULTIMATE.start_main_~end~0#1.base|) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {13940#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {13940#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13940#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {13940#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {13940#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {13940#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))) (not (= (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.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= |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; {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~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); {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} goto; {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} goto; {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~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); {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 23:55:30,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {13950#(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|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {13978#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} is VALID [2022-02-20 23:55:30,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {13978#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {13982#(and (<= 8 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {13982#(and (<= 8 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~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); {13982#(and (<= 8 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 23:55:30,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {13982#(and (<= 8 (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !(4 + (4 + main_~end~0#1.offset) <= #length[main_~end~0#1.base] && 0 <= 4 + main_~end~0#1.offset); {13869#false} is VALID [2022-02-20 23:55:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:30,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:31,124 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-02-20 23:55:31,182 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4)))) is different from false [2022-02-20 23:55:31,201 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 4)))) is different from false [2022-02-20 23:55:31,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:31,245 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-20 23:55:31,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:31,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 37 [2022-02-20 23:55:31,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-02-20 23:55:31,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:31,297 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-02-20 23:55:31,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:31,306 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-02-20 23:55:31,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:31,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-02-20 23:55:31,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:31,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-02-20 23:55:31,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {13989#(and (<= (+ 8 |ULTIMATE.start_main_~end~0#1.offset|) (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (<= 0 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !(4 + (4 + main_~end~0#1.offset) <= #length[main_~end~0#1.base] && 0 <= 4 + main_~end~0#1.offset); {13869#false} is VALID [2022-02-20 23:55:31,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {13989#(and (<= (+ 8 |ULTIMATE.start_main_~end~0#1.offset|) (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (<= 0 (+ 4 |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); {13989#(and (<= (+ 8 |ULTIMATE.start_main_~end~0#1.offset|) (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (<= 0 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:31,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {13996#(and (<= 0 (+ |ULTIMATE.start_main_#t~mem13#1.offset| 4)) (<= (+ |ULTIMATE.start_main_#t~mem13#1.offset| 8) (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {13989#(and (<= (+ 8 |ULTIMATE.start_main_~end~0#1.offset|) (select |#length| |ULTIMATE.start_main_~end~0#1.base|)) (<= 0 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:31,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1046-2 {13996#(and (<= 0 (+ |ULTIMATE.start_main_#t~mem13#1.offset| 4)) (<= (+ |ULTIMATE.start_main_#t~mem13#1.offset| 8) (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)))} is VALID [2022-02-20 23:55:31,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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~mem10#1);havoc main_#t~mem10#1; {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem10#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1046 {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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); {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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~mem9#1);havoc main_#t~mem9#1; {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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); {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {14028#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |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; {14000#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 8) (select |#length| (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:55:31,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {14028#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |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; {14028#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:31,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {14028#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |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; {14028#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:31,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1025 {14028#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:31,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} is VALID [2022-02-20 23:55:31,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} is VALID [2022-02-20 23:55:31,503 WARN L290 TraceCheckUtils]: 14: Hoare triple {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} 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: L1021 {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} is UNKNOWN [2022-02-20 23:55:31,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {14051#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {14038#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} is VALID [2022-02-20 23:55:31,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {14055#(and (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~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: L1020 {14051#(and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))))} is VALID [2022-02-20 23:55:31,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {14055#(and (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {14055#(and (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))))} is VALID [2022-02-20 23:55:31,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {14062#(and (<= 0 (+ |ULTIMATE.start_main_#t~malloc4#1.offset| 4)) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (<= (+ |ULTIMATE.start_main_#t~malloc4#1.offset| 8) (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} 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: L1019 {14055#(and (forall ((v_ArrVal_892 (Array Int Int))) (<= 0 (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 4))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_892) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_893) |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)))))} is VALID [2022-02-20 23:55:31,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {14066#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_10| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_10|) 0)) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_10| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {14062#(and (<= 0 (+ |ULTIMATE.start_main_#t~malloc4#1.offset| 4)) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (<= (+ |ULTIMATE.start_main_#t~malloc4#1.offset| 8) (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))} is VALID [2022-02-20 23:55:31,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {14066#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_10| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_10|) 0)) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_10| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {14066#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_10| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_10|) 0)) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_10| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:31,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {14073#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {14066#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_10| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_10|) 0)) (and (not (= |v_ULTIMATE.start_main_#t~malloc4#1.base_10| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:31,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {14073#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {14073#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:31,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {14073#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 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: L1010 {14073#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:31,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {13868#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {14073#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:31,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {13868#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {13868#true} is VALID [2022-02-20 23:55:31,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {13868#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {13868#true} is VALID [2022-02-20 23:55:31,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {13868#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {13868#true} is VALID [2022-02-20 23:55:31,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {13868#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); {13868#true} is VALID [2022-02-20 23:55:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:31,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881938677] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:31,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:31,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-02-20 23:55:31,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581420140] [2022-02-20 23:55:31,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 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:55:31,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:31,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:31,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 90 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:31,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-20 23:55:31,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-20 23:55:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2022-02-20 23:55:31,600 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,148 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-02-20 23:55:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 23:55:34,148 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 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:55:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 213 transitions. [2022-02-20 23:55:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 213 transitions. [2022-02-20 23:55:34,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 213 transitions. [2022-02-20 23:55:34,364 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:55:34,366 INFO L225 Difference]: With dead ends: 239 [2022-02-20 23:55:34,366 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 23:55:34,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=346, Invalid=1643, Unknown=3, NotChecked=264, Total=2256 [2022-02-20 23:55:34,368 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 526 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 627 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:34,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 629 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1091 Invalid, 0 Unknown, 627 Unchecked, 0.8s Time] [2022-02-20 23:55:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 23:55:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 181. [2022-02-20 23:55:34,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:34,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,372 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,372 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,375 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-02-20 23:55:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2022-02-20 23:55:34,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:34,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:34,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 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 239 states. [2022-02-20 23:55:34,376 INFO L87 Difference]: Start difference. First operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 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 239 states. [2022-02-20 23:55:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:34,378 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2022-02-20 23:55:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2022-02-20 23:55:34,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:34,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:34,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:34,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2022-02-20 23:55:34,381 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 33 [2022-02-20 23:55:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:34,381 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2022-02-20 23:55:34,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.935483870967742) internal successors, (91), 32 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2022-02-20 23:55:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:55:34,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:34,382 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] [2022-02-20 23:55:34,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 23:55:34,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:34,599 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1639111831, now seen corresponding path program 1 times [2022-02-20 23:55:34,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:34,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085831859] [2022-02-20 23:55:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:35,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {15026#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); {15026#true} is VALID [2022-02-20 23:55:35,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {15026#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {15028#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:35,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {15028#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {15028#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:35,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {15028#(= |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: L1006-1 {15028#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} is VALID [2022-02-20 23:55:35,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {15028#(= |ULTIMATE.start_main_~null~0#1.offset| 0)} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {15029#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {15029#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |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: L1010 {15030#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {15030#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {15031#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {15031#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |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; {15032#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {15032#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15032#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {15032#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {15033#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {15033#(and (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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: L1019 {15034#(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_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {15034#(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_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {15034#(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_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {15034#(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_~list~0#1.offset| 4) |ULTIMATE.start_main_~end~0#1.offset|)) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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: L1020 {15035#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:55:35,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {15035#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1029 {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {15036#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8); {15037#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {15037#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1030 {15038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {15038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {15038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {15038#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1031 {15039#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {15039#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {15040#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {15040#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1032 {15040#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {15040#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1032-1 {15041#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {15041#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15041#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {15041#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15041#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {15041#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |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; {15042#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (= |ULTIMATE.start_main_~null~0#1.offset| 0))} is VALID [2022-02-20 23:55:35,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {15042#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_~end~0#1.offset|) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |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); {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:35,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:35,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {15044#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:35,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {15044#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {15027#false} is VALID [2022-02-20 23:55:35,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {15027#false} assume !false; {15027#false} is VALID [2022-02-20 23:55:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:35,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:35,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085831859] [2022-02-20 23:55:35,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085831859] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:35,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432969704] [2022-02-20 23:55:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:35,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:35,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:35,196 INFO L229 MonitoredProcess]: Starting monitored process 7 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:55:35,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:55:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:35,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-20 23:55:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:35,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:35,322 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:55:35,335 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:55:35,400 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:35,401 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:55:35,455 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:55:35,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:35,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:55:35,529 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 16 treesize of output 8 [2022-02-20 23:55:35,587 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 16 treesize of output 18 [2022-02-20 23:55:35,632 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 16 treesize of output 18 [2022-02-20 23:55:35,644 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:35,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:55:35,687 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 16 treesize of output 18 [2022-02-20 23:55:35,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:55:35,750 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 16 treesize of output 8 [2022-02-20 23:55:35,802 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 16 treesize of output 18 [2022-02-20 23:55:35,823 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 16 treesize of output 18 [2022-02-20 23:55:35,872 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:55:35,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {15026#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); {15026#true} is VALID [2022-02-20 23:55:35,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {15026#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {15026#true} is VALID [2022-02-20 23:55:35,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {15026#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {15026#true} is VALID [2022-02-20 23:55:35,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {15026#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {15026#true} is VALID [2022-02-20 23:55:35,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {15026#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {15060#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:35,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {15060#(= (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: L1010 {15060#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} is VALID [2022-02-20 23:55:35,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {15060#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {15067#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:35,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {15067#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {15071#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:35,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {15071#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15071#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:35,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {15071#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {15078#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:35,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {15078#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_#t~malloc4#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#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: L1019 {15082#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:35,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {15082#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {15082#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} is VALID [2022-02-20 23:55:35,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {15082#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|))} 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: L1020 {15089#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} is VALID [2022-02-20 23:55:35,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {15089#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem5#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1021 {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1029 {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {15093#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8); {15109#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {15109#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1030 {15113#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {15113#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {15113#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {15113#(and (not (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1031 {15120#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:35,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {15120#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {15124#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {15124#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1032 {15124#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 23:55:35,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {15124#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1032-1 {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:35,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:35,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:35,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} 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; {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:35,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |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); {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:35,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:35,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {15044#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:35,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {15044#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {15027#false} is VALID [2022-02-20 23:55:35,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {15027#false} assume !false; {15027#false} is VALID [2022-02-20 23:55:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:35,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:35,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:35,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:35,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:35,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2022-02-20 23:55:36,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) 0)))) is different from false [2022-02-20 23:55:36,242 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:55:36,242 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 13 treesize of output 12 [2022-02-20 23:55:36,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_6| |c_ULTIMATE.start_main_~end~0#1.base|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))))) is different from false [2022-02-20 23:55:36,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_72| Int) (v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_ArrVal_1040 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_72| |c_ULTIMATE.start_main_~list~0#1.offset|)) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_72| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_6| |c_ULTIMATE.start_main_~list~0#1.base|))) is different from false [2022-02-20 23:55:36,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:36,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:36,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-02-20 23:55:37,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:37,046 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 36 treesize of output 24 [2022-02-20 23:55:37,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-02-20 23:55:37,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {15027#false} assume !false; {15027#false} is VALID [2022-02-20 23:55:37,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {15044#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {15027#false} is VALID [2022-02-20 23:55:37,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~int(main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1042-4 {15044#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:37,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:37,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |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); {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:37,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} 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; {15043#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:55:37,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:37,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:37,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {15180#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1032-1 {15131#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))} is VALID [2022-02-20 23:55:37,089 WARN L290 TraceCheckUtils]: 23: Hoare triple {15180#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} 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: L1032 {15180#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is UNKNOWN [2022-02-20 23:55:37,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {15187#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {15180#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:37,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {15191#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1031 {15187#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:37,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {15191#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {15191#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:37,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {15198#(forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4); srcloc: L1030 {15191#(forall ((v_ArrVal_1043 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is VALID [2022-02-20 23:55:37,093 WARN L290 TraceCheckUtils]: 18: Hoare triple {15202#(forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8); {15198#(forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))} is UNKNOWN [2022-02-20 23:55:37,095 WARN L290 TraceCheckUtils]: 17: Hoare triple {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} SUMMARY for call write~int(~unnamed1~0~RED, main_~end~0#1.base, 4 + main_~end~0#1.offset, 4); srcloc: L1029 {15202#(forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int)) (or (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (forall ((v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))))))} is UNKNOWN [2022-02-20 23:55:37,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is VALID [2022-02-20 23:55:37,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is VALID [2022-02-20 23:55:37,107 WARN L290 TraceCheckUtils]: 14: Hoare triple {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} 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: L1021 {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is UNKNOWN [2022-02-20 23:55:37,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {15219#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {15206#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is VALID [2022-02-20 23:55:37,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {15223#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= (select (select (store (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} 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: L1020 {15219#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is VALID [2022-02-20 23:55:37,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {15223#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= (select (select (store (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {15223#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= (select (select (store (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is VALID [2022-02-20 23:55:37,111 WARN L290 TraceCheckUtils]: 10: Hoare triple {15230#(forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))))} 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: L1019 {15223#(forall ((v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= (select (select (store (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= 0 (select |#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))} is UNKNOWN [2022-02-20 23:55:37,113 WARN L290 TraceCheckUtils]: 9: Hoare triple {15234#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (or (forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8); {15230#(forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))))} is UNKNOWN [2022-02-20 23:55:37,116 WARN L290 TraceCheckUtils]: 8: Hoare triple {15234#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (or (forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15234#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (or (forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))} is UNKNOWN [2022-02-20 23:55:37,117 WARN L290 TraceCheckUtils]: 7: Hoare triple {15241#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_72| Int) (v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_ArrVal_1040 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_72| |ULTIMATE.start_main_~list~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_6| |ULTIMATE.start_main_~list~0#1.base|) (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~list~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_72| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {15234#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (or (forall ((v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (v_ArrVal_1040 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (= |ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))} is UNKNOWN [2022-02-20 23:55:37,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {15245#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4); srcloc: L1010-1 {15241#(forall ((|v_ULTIMATE.start_main_~end~0#1.offset_72| Int) (v_ArrVal_1036 Int) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_6| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_ArrVal_1040 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_72| |ULTIMATE.start_main_~list~0#1.offset|)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_6| |ULTIMATE.start_main_~list~0#1.base|) (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~list~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_72| v_ArrVal_1036)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1040) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1043) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))} is VALID [2022-02-20 23:55:37,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {15245#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 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: L1010 {15245#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:37,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {15026#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8);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; {15245#(not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 0))} is VALID [2022-02-20 23:55:37,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {15026#true} SUMMARY for call write~$Pointer$(0, 0, main_~null~0#1.base, main_~null~0#1.offset, 4); srcloc: L1006-1 {15026#true} is VALID [2022-02-20 23:55:37,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {15026#true} SUMMARY for call write~int(~unnamed1~0~BLACK, main_~null~0#1.base, 4 + main_~null~0#1.offset, 4); srcloc: L1006 {15026#true} is VALID [2022-02-20 23:55:37,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {15026#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8);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; {15026#true} is VALID [2022-02-20 23:55:37,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {15026#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); {15026#true} is VALID [2022-02-20 23:55:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:37,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432969704] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:37,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:55:37,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 17] total 43 [2022-02-20 23:55:37,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356232309] [2022-02-20 23:55:37,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:37,121 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 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:55:37,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:37,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:37,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 73 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:37,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-20 23:55:37,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-20 23:55:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1063, Unknown=17, NotChecked=518, Total=1806 [2022-02-20 23:55:37,212 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:39,480 INFO L93 Difference]: Finished difference Result 424 states and 460 transitions. [2022-02-20 23:55:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 23:55:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 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:55:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 358 transitions. [2022-02-20 23:55:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 358 transitions. [2022-02-20 23:55:39,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 358 transitions. [2022-02-20 23:55:39,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 357 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:39,794 INFO L225 Difference]: With dead ends: 424 [2022-02-20 23:55:39,794 INFO L226 Difference]: Without dead ends: 424 [2022-02-20 23:55:39,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=428, Invalid=2033, Unknown=17, NotChecked=714, Total=3192 [2022-02-20 23:55:39,796 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 562 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1541 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:39,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 885 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1129 Invalid, 0 Unknown, 1541 Unchecked, 0.7s Time] [2022-02-20 23:55:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-02-20 23:55:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 189. [2022-02-20 23:55:39,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:39,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,799 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,799 INFO L87 Difference]: Start difference. First operand 424 states. Second operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:39,805 INFO L93 Difference]: Finished difference Result 424 states and 460 transitions. [2022-02-20 23:55:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 460 transitions. [2022-02-20 23:55:39,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:39,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:39,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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 424 states. [2022-02-20 23:55:39,806 INFO L87 Difference]: Start difference. First operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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 424 states. [2022-02-20 23:55:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:39,812 INFO L93 Difference]: Finished difference Result 424 states and 460 transitions. [2022-02-20 23:55:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 460 transitions. [2022-02-20 23:55:39,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:39,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:39,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:39,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-02-20 23:55:39,815 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 33 [2022-02-20 23:55:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:39,815 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-02-20 23:55:39,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-02-20 23:55:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:55:39,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:39,816 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:55:39,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:40,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:40,033 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:40,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash 705439333, now seen corresponding path program 1 times [2022-02-20 23:55:40,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:40,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865103589] [2022-02-20 23:55:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:40,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:40,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:55:40,066 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:55:40,071 INFO L158 Benchmark]: Toolchain (without parser) took 36045.55ms. Allocated memory was 98.6MB in the beginning and 224.4MB in the end (delta: 125.8MB). Free memory was 68.5MB in the beginning and 132.8MB in the end (delta: -64.4MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2022-02-20 23:55:40,071 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:55:40,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.82ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:55:40,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.68ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 63.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:40,072 INFO L158 Benchmark]: Boogie Preprocessor took 22.59ms. Allocated memory is still 98.6MB. Free memory was 63.6MB in the beginning and 61.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:40,072 INFO L158 Benchmark]: RCFGBuilder took 490.54ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 61.3MB in the beginning and 89.5MB in the end (delta: -28.2MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:40,072 INFO L158 Benchmark]: TraceAbstraction took 35088.91ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 88.9MB in the beginning and 132.8MB in the end (delta: -44.0MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-02-20 23:55:40,073 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.14ms. Allocated memory is still 98.6MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.82ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.68ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 63.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.59ms. Allocated memory is still 98.6MB. Free memory was 63.6MB in the beginning and 61.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.54ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 61.3MB in the beginning and 89.5MB in the end (delta: -28.2MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35088.91ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 88.9MB in the beginning and 132.8MB in the end (delta: -44.0MB). Peak memory consumption was 51.0MB. 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:55:40,119 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/sll-rb-sentinel-1.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 b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:55:41,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:55:41,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:55:41,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:55:41,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:55:41,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:55:41,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:55:41,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:55:41,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:55:41,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:55:41,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:55:41,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:55:41,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:55:41,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:55:41,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:55:41,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:55:41,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:55:41,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:55:41,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:55:41,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:55:41,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:55:41,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:55:41,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:55:41,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:55:41,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:55:41,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:55:41,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:55:41,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:55:41,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:55:41,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:55:41,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:55:41,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:55:41,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:55:41,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:55:41,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:55:41,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:55:41,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:55:41,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:55:41,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:55:41,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:55:41,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:55:41,830 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:55:41,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:55:41,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:55:41,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:55:41,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:55:41,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:55:41,852 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:55:41,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:55:41,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:55:41,853 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:55:41,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:55:41,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:55:41,854 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:55:41,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:55:41,855 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:55:41,856 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:55:41,856 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:55:41,856 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:55:41,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:55:41,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:55:41,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:55:41,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:55:41,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:41,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:55:41,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:55:41,857 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:55:41,857 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:55:41,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:55:41,858 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 -> b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 [2022-02-20 23:55:42,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:55:42,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:55:42,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:55:42,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:55:42,117 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:55:42,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2022-02-20 23:55:42,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591eac9c4/9b9cb05ccf6b48708529fafd48b99a19/FLAG722efe15e [2022-02-20 23:55:42,547 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:55:42,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2022-02-20 23:55:42,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591eac9c4/9b9cb05ccf6b48708529fafd48b99a19/FLAG722efe15e [2022-02-20 23:55:42,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591eac9c4/9b9cb05ccf6b48708529fafd48b99a19 [2022-02-20 23:55:42,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:55:42,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:55:42,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:42,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:55:42,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:55:42,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b725e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42, skipping insertion in model container [2022-02-20 23:55:42,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:55:42,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:55:42,801 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/sll-rb-sentinel-1.i[22534,22547] [2022-02-20 23:55:42,815 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/sll-rb-sentinel-1.i[22606,22619] [2022-02-20 23:55:42,816 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/sll-rb-sentinel-1.i[22746,22759] [2022-02-20 23:55:42,817 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/sll-rb-sentinel-1.i[22820,22833] [2022-02-20 23:55:42,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:42,839 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:55:42,872 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/sll-rb-sentinel-1.i[22534,22547] [2022-02-20 23:55:42,873 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/sll-rb-sentinel-1.i[22606,22619] [2022-02-20 23:55:42,874 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/sll-rb-sentinel-1.i[22746,22759] [2022-02-20 23:55:42,874 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/sll-rb-sentinel-1.i[22820,22833] [2022-02-20 23:55:42,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:42,898 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:55:42,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42 WrapperNode [2022-02-20 23:55:42,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:42,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:42,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:55:42,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:55:42,904 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:55:42" (1/1) ... [2022-02-20 23:55:42,924 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:55:42" (1/1) ... [2022-02-20 23:55:42,957 INFO L137 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2022-02-20 23:55:42,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:42,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:55:42,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:55:42,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:55:42,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:42,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:55:42,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:55:42,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:55:42,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:55:42,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (1/1) ... [2022-02-20 23:55:43,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:43,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:43,032 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:55:43,083 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:55:43,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:55:43,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:55:43,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:55:43,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:55:43,189 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:55:43,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:55:43,576 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:55:43,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:55:43,584 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 23:55:43,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:43 BoogieIcfgContainer [2022-02-20 23:55:43,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:55:43,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:55:43,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:55:43,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:55:43,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:55:42" (1/3) ... [2022-02-20 23:55:43,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:43, skipping insertion in model container [2022-02-20 23:55:43,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:42" (2/3) ... [2022-02-20 23:55:43,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:43, skipping insertion in model container [2022-02-20 23:55:43,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:43" (3/3) ... [2022-02-20 23:55:43,591 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2022-02-20 23:55:43,595 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:55:43,595 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-02-20 23:55:43,622 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:55:43,627 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:55:43,627 INFO L340 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-02-20 23:55:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 130 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:43,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:43,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:43,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:55:43,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:43,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565071484] [2022-02-20 23:55:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:43,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:43,686 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:55:43,687 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:55:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:43,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:55:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:43,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:43,811 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:55:43,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#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); {134#true} is VALID [2022-02-20 23:55:43,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {142#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:43,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~null~0#1.base]); {135#false} is VALID [2022-02-20 23:55:43,825 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:55:43,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:43,826 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:43,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565071484] [2022-02-20 23:55:43,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565071484] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:43,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:43,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:43,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573555133] [2022-02-20 23:55:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:43,832 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:55:43,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:43,835 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:55:43,840 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:55:43,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:43,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:43,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:43,869 INFO L87 Difference]: Start difference. First operand has 131 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 130 states have internal predecessors, (151), 0 states have call successors, (0), 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:55:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:44,384 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2022-02-20 23:55:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:44,384 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:55:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:44,386 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:55:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 23:55:44,403 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:55:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 23:55:44,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2022-02-20 23:55:44,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:44,623 INFO L225 Difference]: With dead ends: 159 [2022-02-20 23:55:44,623 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:55:44,625 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:55:44,628 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:44,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:55:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-02-20 23:55:44,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:44,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:44,672 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:44,673 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:44,685 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2022-02-20 23:55:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2022-02-20 23:55:44,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:44,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:44,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 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:55:44,689 INFO L87 Difference]: Start difference. First operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 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:55:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:44,700 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2022-02-20 23:55:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2022-02-20 23:55:44,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:44,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:44,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:44,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2022-02-20 23:55:44,713 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 3 [2022-02-20 23:55:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:44,714 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2022-02-20 23:55:44,714 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:55:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2022-02-20 23:55:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:44,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:44,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:44,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:55:44,923 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:55:44,924 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:55:44,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:44,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883028989] [2022-02-20 23:55:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:44,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:44,928 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:55:44,929 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:55:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:44,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:44,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:44,982 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:55:44,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {749#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); {749#true} is VALID [2022-02-20 23:55:44,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {749#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {757#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~null~0#1.base|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:44,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~null~0#1.base|)) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~null~0#1.offset)), #length[main_~null~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~null~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~null~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~null~0#1.offset))); {750#false} is VALID [2022-02-20 23:55:44,991 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:55:44,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:44,991 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:44,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883028989] [2022-02-20 23:55:44,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883028989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:44,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:44,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:44,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640682836] [2022-02-20 23:55:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:44,993 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:55:44,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:44,993 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:55:44,997 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:55:44,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:44,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:44,998 INFO L87 Difference]: Start difference. First operand 131 states and 139 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:55:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:45,358 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2022-02-20 23:55:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:45,358 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:55:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:45,358 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:55:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 23:55:45,360 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:55:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 23:55:45,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2022-02-20 23:55:45,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:45,469 INFO L225 Difference]: With dead ends: 128 [2022-02-20 23:55:45,469 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:55:45,469 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:55:45,470 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:45,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 71 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:55:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-02-20 23:55:45,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:45,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:45,474 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:45,475 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:45,478 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2022-02-20 23:55:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2022-02-20 23:55:45,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:45,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:45,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 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 128 states. [2022-02-20 23:55:45,482 INFO L87 Difference]: Start difference. First operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 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 128 states. [2022-02-20 23:55:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:45,491 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2022-02-20 23:55:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2022-02-20 23:55:45,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:45,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:45,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:45,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2022-02-20 23:55:45,511 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 3 [2022-02-20 23:55:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:45,512 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2022-02-20 23:55:45,512 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:55:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2022-02-20 23:55:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:45,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:45,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:45,522 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:55:45,713 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:55:45,713 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-02-20 23:55:45,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:45,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339666966] [2022-02-20 23:55:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:45,731 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:55:45,765 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:55:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:45,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:55:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:45,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:45,852 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:55:45,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {1272#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); {1272#true} is VALID [2022-02-20 23:55:45,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {1272#true} is VALID [2022-02-20 23:55:45,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {1272#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {1272#true} is VALID [2022-02-20 23:55:45,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {1272#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {1272#true} is VALID [2022-02-20 23:55:45,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {1272#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {1289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:45,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {1289#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~list~0#1.base]); {1273#false} is VALID [2022-02-20 23:55:45,858 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:55:45,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:45,858 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:45,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339666966] [2022-02-20 23:55:45,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339666966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:45,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:45,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:45,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931875728] [2022-02-20 23:55:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:45,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:45,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:45,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:45,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:45,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:45,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:45,872 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:46,176 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-02-20 23:55:46,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:46,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 23:55:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 23:55:46,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 23:55:46,295 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:55:46,296 INFO L225 Difference]: With dead ends: 125 [2022-02-20 23:55:46,296 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 23:55:46,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:55:46,297 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:46,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 80 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 23:55:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-02-20 23:55:46,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:46,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,301 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,301 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:46,303 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-02-20 23:55:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2022-02-20 23:55:46,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:46,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:46,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 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 125 states. [2022-02-20 23:55:46,304 INFO L87 Difference]: Start difference. First operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 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 125 states. [2022-02-20 23:55:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:46,306 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-02-20 23:55:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2022-02-20 23:55:46,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:46,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:46,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:46,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2022-02-20 23:55:46,309 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 6 [2022-02-20 23:55:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:46,309 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2022-02-20 23:55:46,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2022-02-20 23:55:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:46,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:46,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:46,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:55:46,516 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:55:46,517 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-02-20 23:55:46,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:46,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749385819] [2022-02-20 23:55:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:46,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:46,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:46,526 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:55:46,526 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:55:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:46,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:46,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:46,591 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:55:46,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {1790#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); {1790#true} is VALID [2022-02-20 23:55:46,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1790#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {1790#true} is VALID [2022-02-20 23:55:46,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1790#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {1790#true} is VALID [2022-02-20 23:55:46,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {1790#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {1790#true} is VALID [2022-02-20 23:55:46,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {1790#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {1807#(and (= (_ bv8 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:55:46,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#(and (= (_ bv8 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)); {1791#false} is VALID [2022-02-20 23:55:46,601 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:55:46,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:46,601 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:46,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749385819] [2022-02-20 23:55:46,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749385819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:46,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:46,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:46,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588958224] [2022-02-20 23:55:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:46,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:46,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:46,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:46,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:46,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:46,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:46,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:46,611 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:46,955 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-02-20 23:55:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:55:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:55:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:55:46,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2022-02-20 23:55:47,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:47,095 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:55:47,095 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:55:47,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:55:47,096 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 99 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:47,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 89 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:55:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2022-02-20 23:55:47,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:47,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,100 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,100 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:47,102 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-02-20 23:55:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2022-02-20 23:55:47,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:47,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:47,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 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 141 states. [2022-02-20 23:55:47,103 INFO L87 Difference]: Start difference. First operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 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 141 states. [2022-02-20 23:55:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:47,105 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-02-20 23:55:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2022-02-20 23:55:47,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:47,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:47,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:47,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.7) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-02-20 23:55:47,108 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 6 [2022-02-20 23:55:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:47,109 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-02-20 23:55:47,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-02-20 23:55:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:55:47,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:47,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:47,124 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:55:47,316 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:55:47,316 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1113926540, now seen corresponding path program 1 times [2022-02-20 23:55:47,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:47,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164822837] [2022-02-20 23:55:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:47,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:47,318 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:55:47,320 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:55:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:47,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:55:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:47,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:47,414 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:55:47,456 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:55:47,456 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:55:47,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {2361#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); {2361#true} is VALID [2022-02-20 23:55:47,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {2361#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {2361#true} is VALID [2022-02-20 23:55:47,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {2361#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {2361#true} is VALID [2022-02-20 23:55:47,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {2361#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {2361#true} is VALID [2022-02-20 23:55:47,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {2361#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {2378#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:47,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {2378#(= (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: L1010 {2378#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:47,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {2378#(= (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(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {2378#(= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:47,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {2378#(= (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; {2388#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:47,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {2388#(= (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(8bv32); {2388#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:47,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {2388#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~end~0#1.base]); {2362#false} is VALID [2022-02-20 23:55:47,470 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:55:47,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:47,470 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:47,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164822837] [2022-02-20 23:55:47,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164822837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:47,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:47,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:47,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624419455] [2022-02-20 23:55:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:55:47,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:47,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:47,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:47,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:47,483 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:47,939 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:55:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:55:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-02-20 23:55:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-02-20 23:55:47,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 146 transitions. [2022-02-20 23:55:48,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:48,053 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:55:48,053 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:55:48,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:55:48,056 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 158 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:48,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 72 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:55:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2022-02-20 23:55:48,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:48,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,070 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,070 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:48,072 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:55:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:55:48,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:48,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:48,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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 132 states. [2022-02-20 23:55:48,073 INFO L87 Difference]: Start difference. First operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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 132 states. [2022-02-20 23:55:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:48,083 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:55:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:55:48,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:48,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:48,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:48,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-02-20 23:55:48,085 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 10 [2022-02-20 23:55:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:48,085 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-02-20 23:55:48,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-02-20 23:55:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:55:48,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:48,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:48,095 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:55:48,286 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:55:48,287 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1113926541, now seen corresponding path program 1 times [2022-02-20 23:55:48,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:48,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098173761] [2022-02-20 23:55:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:48,289 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:55:48,291 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:55:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:48,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:55:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:48,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:48,417 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:55:48,558 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:48,559 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:55:48,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {2911#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); {2911#true} is VALID [2022-02-20 23:55:48,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {2911#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {2911#true} is VALID [2022-02-20 23:55:48,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {2911#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {2911#true} is VALID [2022-02-20 23:55:48,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {2911#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {2911#true} is VALID [2022-02-20 23:55:48,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {2911#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {2928#(and (= (_ bv8 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:55:48,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {2928#(and (= (_ bv8 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: L1010 {2928#(and (= (_ bv8 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:55:48,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {2928#(and (= (_ bv8 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(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {2928#(and (= (_ bv8 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:55:48,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {2928#(and (= (_ bv8 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; {2938#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:48,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 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(8bv32); {2938#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:48,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 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)); {2912#false} is VALID [2022-02-20 23:55:48,578 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:55:48,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:48,591 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:48,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098173761] [2022-02-20 23:55:48,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098173761] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:48,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:48,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:48,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909696472] [2022-02-20 23:55:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:55:48,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:48,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:48,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:48,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:48,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:48,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:48,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:48,606 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:49,324 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-02-20 23:55:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:49,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:55:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-02-20 23:55:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-02-20 23:55:49,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-02-20 23:55:49,480 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:55:49,482 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:55:49,482 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:55:49,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:49,483 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 146 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:49,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 98 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:55:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2022-02-20 23:55:49,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:49,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,486 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,486 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:49,495 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-02-20 23:55:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-02-20 23:55:49,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:49,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:49,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:55:49,496 INFO L87 Difference]: Start difference. First operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:55:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:49,498 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-02-20 23:55:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-02-20 23:55:49,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:49,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:49,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:49,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-02-20 23:55:49,515 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 10 [2022-02-20 23:55:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:49,515 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-02-20 23:55:49,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:55:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:49,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:49,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:49,525 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:55:49,723 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:55:49,723 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:49,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1036529431, now seen corresponding path program 1 times [2022-02-20 23:55:49,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:49,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372625526] [2022-02-20 23:55:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:49,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:49,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:49,725 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:55:49,726 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:55:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:49,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:55:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:49,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:49,794 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:55:49,819 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:49,820 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:55:49,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {3536#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); {3536#true} is VALID [2022-02-20 23:55:49,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {3536#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {3544#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:49,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {3544#(= (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(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {3544#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:49,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {3544#(= (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: L1006-1 {3544#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:49,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {3544#(= (select |#valid| |ULTIMATE.start_main_~null~0#1.base|) (_ bv1 1))} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {3554#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:49,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {3554#(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: L1010 {3554#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:49,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {3554#(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(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {3554#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:49,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {3554#(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; {3554#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:49,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {3554#(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; {3554#(not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:49,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {3554#(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; {3570#(not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~null~0#1.base|))} is VALID [2022-02-20 23:55:49,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {3570#(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); {3537#false} is VALID [2022-02-20 23:55:49,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {3537#false} assume !false; {3537#false} is VALID [2022-02-20 23:55:49,862 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:55:49,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:49,862 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:49,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372625526] [2022-02-20 23:55:49,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372625526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:49,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:49,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:49,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52725594] [2022-02-20 23:55:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:49,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:49,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:49,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:49,874 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:55:49,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:49,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:49,875 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:50,742 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:55:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2022-02-20 23:55:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2022-02-20 23:55:50,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 178 transitions. [2022-02-20 23:55:50,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:50,983 INFO L225 Difference]: With dead ends: 164 [2022-02-20 23:55:50,983 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 23:55:50,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:55:50,984 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 225 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:50,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 125 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 23:55:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2022-02-20 23:55:50,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:50,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:50,998 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:50,998 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,001 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:55:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2022-02-20 23:55:51,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:51,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:51,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 0 states have call successors, (0), 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:55:51,002 INFO L87 Difference]: Start difference. First operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 0 states have call successors, (0), 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:55:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,005 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-02-20 23:55:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2022-02-20 23:55:51,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:51,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:51,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:51,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 125 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-02-20 23:55:51,007 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 12 [2022-02-20 23:55:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:51,008 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-02-20 23:55:51,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:55:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-02-20 23:55:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:55:51,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:51,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:51,017 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:55:51,217 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:55:51,220 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -309587570, now seen corresponding path program 1 times [2022-02-20 23:55:51,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:51,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317694735] [2022-02-20 23:55:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:51,222 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:55:51,223 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:55:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:51,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:55:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:51,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:51,361 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:55:51,392 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:55:51,433 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:55:51,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {4198#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); {4198#true} is VALID [2022-02-20 23:55:51,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {4198#true} is VALID [2022-02-20 23:55:51,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {4198#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {4198#true} is VALID [2022-02-20 23:55:51,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {4198#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {4198#true} is VALID [2022-02-20 23:55:51,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {4198#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {4198#true} is VALID [2022-02-20 23:55:51,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#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: L1010 {4198#true} is VALID [2022-02-20 23:55:51,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {4198#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {4198#true} is VALID [2022-02-20 23:55:51,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {4198#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4198#true} is VALID [2022-02-20 23:55:51,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {4198#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(8bv32); {4227#(= (select |#valid| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:51,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(= (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: L1019 {4231#(= (_ 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:55:51,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {4231#(= (_ 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; {4231#(= (_ 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:55:51,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {4231#(= (_ 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: L1020 {4238#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:51,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {4238#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {4242#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:51,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {4242#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~end~0#1.base]); {4199#false} is VALID [2022-02-20 23:55:51,456 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:55:51,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:51,457 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:51,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317694735] [2022-02-20 23:55:51,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317694735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:51,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:51,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:51,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118690982] [2022-02-20 23:55:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:51,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:51,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:51,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:51,472 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:55:51,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:51,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:51,473 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,675 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-02-20 23:55:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:55:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-02-20 23:55:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-02-20 23:55:52,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2022-02-20 23:55:52,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:52,784 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:55:52,784 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:55:52,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:52,785 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:52,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 251 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:55:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:55:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-02-20 23:55:52,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:52,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,787 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,787 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,789 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-02-20 23:55:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-02-20 23:55:52,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:52,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:52,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 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 126 states. [2022-02-20 23:55:52,790 INFO L87 Difference]: Start difference. First operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 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 126 states. [2022-02-20 23:55:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,798 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-02-20 23:55:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-02-20 23:55:52,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:52,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:52,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:52,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.4945054945054945) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-02-20 23:55:52,807 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 14 [2022-02-20 23:55:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:52,809 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-02-20 23:55:52,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:55:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:55:52,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:52,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:52,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:53,017 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:55:53,017 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash -309587569, now seen corresponding path program 1 times [2022-02-20 23:55:53,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:53,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642674837] [2022-02-20 23:55:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:53,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:53,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:53,026 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:55:53,027 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:55:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:53,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:55:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:53,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:53,133 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:55:53,157 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:55:53,162 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:55:53,205 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:55:53,220 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:55:53,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {4756#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); {4756#true} is VALID [2022-02-20 23:55:53,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {4756#true} is VALID [2022-02-20 23:55:53,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {4756#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {4756#true} is VALID [2022-02-20 23:55:53,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {4756#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {4756#true} is VALID [2022-02-20 23:55:53,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {4756#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {4756#true} is VALID [2022-02-20 23:55:53,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {4756#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: L1010 {4756#true} is VALID [2022-02-20 23:55:53,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {4756#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {4756#true} is VALID [2022-02-20 23:55:53,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {4756#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {4756#true} is VALID [2022-02-20 23:55:53,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {4756#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(8bv32); {4785#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc4#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:53,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {4785#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc4#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc4#1.offset| (_ bv0 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: L1019 {4789#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (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:55:53,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {4789#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (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; {4789#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (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:55:53,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {4789#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (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: L1020 {4796#(and (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:53,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {4796#(and (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {4800#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:53,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {4800#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 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)); {4757#false} is VALID [2022-02-20 23:55:53,254 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:55:53,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:53,254 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:53,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642674837] [2022-02-20 23:55:53,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642674837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:53,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:53,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:55:53,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891748943] [2022-02-20 23:55:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:53,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:53,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:53,271 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:55:53,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:53,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:53,272 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:54,350 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-02-20 23:55:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:55:54,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-02-20 23:55:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-02-20 23:55:54,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-02-20 23:55:54,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:54,451 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:55:54,451 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:55:54,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:55:54,452 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 16 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:54,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 294 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:55:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:55:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-02-20 23:55:54,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:54,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:54,454 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:54,454 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:54,456 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-02-20 23:55:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-02-20 23:55:54,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:54,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:54,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 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 126 states. [2022-02-20 23:55:54,457 INFO L87 Difference]: Start difference. First operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 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 126 states. [2022-02-20 23:55:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:54,458 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-02-20 23:55:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-02-20 23:55:54,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:54,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:54,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:54,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 119 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2022-02-20 23:55:54,469 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 14 [2022-02-20 23:55:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:54,470 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2022-02-20 23:55:54,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:55:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-02-20 23:55:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:54,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:54,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:54,495 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:55:54,677 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:55:54,678 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:54,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1562589153, now seen corresponding path program 1 times [2022-02-20 23:55:54,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:54,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344841432] [2022-02-20 23:55:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:54,682 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:55:54,683 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:55:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:54,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:55:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:54,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:54,784 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:55:54,852 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:55:54,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {5313#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); {5313#true} is VALID [2022-02-20 23:55:54,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {5313#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {5313#true} is VALID [2022-02-20 23:55:54,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {5313#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {5313#true} is VALID [2022-02-20 23:55:54,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {5313#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {5313#true} is VALID [2022-02-20 23:55:54,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {5313#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {5330#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:54,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {5330#(= |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: L1010 {5330#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:54,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {5330#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {5337#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:54,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {5337#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {5337#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:54,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {5337#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {5337#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:54,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {5337#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {5347#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:54,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {5347#(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 (_ bv4 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); {5347#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:54,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {5347#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {5347#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:54,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {5347#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {5357#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:55:54,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {5357#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {5314#false} is VALID [2022-02-20 23:55:54,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {5314#false} assume !false; {5314#false} is VALID [2022-02-20 23:55:54,866 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:55:54,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:54,866 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:54,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344841432] [2022-02-20 23:55:54,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344841432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:54,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:54,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:54,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204363279] [2022-02-20 23:55:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:54,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:54,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:54,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:54,882 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:55:54,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:54,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:54,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:54,883 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:55,904 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2022-02-20 23:55:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:55:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2022-02-20 23:55:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2022-02-20 23:55:55,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 177 transitions. [2022-02-20 23:55:56,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:56,163 INFO L225 Difference]: With dead ends: 180 [2022-02-20 23:55:56,163 INFO L226 Difference]: Without dead ends: 180 [2022-02-20 23:55:56,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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:55:56,163 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 144 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:56,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 268 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-20 23:55:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2022-02-20 23:55:56,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:56,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:56,166 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:56,166 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:56,168 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2022-02-20 23:55:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2022-02-20 23:55:56,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:56,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:56,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 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 180 states. [2022-02-20 23:55:56,179 INFO L87 Difference]: Start difference. First operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 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 180 states. [2022-02-20 23:55:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:56,181 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2022-02-20 23:55:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2022-02-20 23:55:56,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:56,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:56,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:56,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.422680412371134) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-02-20 23:55:56,184 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 15 [2022-02-20 23:55:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:56,184 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-02-20 23:55:56,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:55:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-02-20 23:55:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:55:56,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:56,185 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] [2022-02-20 23:55:56,194 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:55:56,392 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:55:56,392 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2057287877, now seen corresponding path program 1 times [2022-02-20 23:55:56,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:56,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593056808] [2022-02-20 23:55:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:56,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:56,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:56,394 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:55:56,396 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:55:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:56,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:55:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:56,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:56,576 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:55:56,582 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:55:56,627 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:55:56,628 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:55:56,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:56,637 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:55:56,810 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:55:56,813 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:55:56,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {6033#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); {6033#true} is VALID [2022-02-20 23:55:56,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {6033#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {6041#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:56,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {6041#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {6041#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:56,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {6041#(= |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: L1006-1 {6041#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:56,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {6041#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {6041#(= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:56,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {6041#(= |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: L1010 {6054#(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:55:56,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {6054#(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(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {6054#(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:55:56,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {6054#(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; {6054#(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:55:56,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {6054#(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; {6054#(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:55:56,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {6054#(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; {6067#(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:55:56,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {6067#(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); {6067#(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:55:56,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {6067#(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; {6067#(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:55:56,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(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~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {6067#(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:55:56,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#(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~mem9#1);havoc main_#t~mem9#1; {6067#(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:55:56,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#(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; {6067#(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:55:56,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {6067#(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); {6067#(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:55:56,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#(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~mem10#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1046 {6067#(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:55:56,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#(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~mem10#1);havoc main_#t~mem10#1; {6067#(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:55:56,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {6067#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1046-2 {6095#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem13#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:56,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {6095#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem13#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|) (= |ULTIMATE.start_main_~null~0#1.offset| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {6099#(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:55:56,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {6099#(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); {6034#false} is VALID [2022-02-20 23:55:56,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {6034#false} assume !(1bv1 == #valid[main_~end~0#1.base]); {6034#false} is VALID [2022-02-20 23:55:56,868 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:55:56,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:57,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {6034#false} assume !(1bv1 == #valid[main_~end~0#1.base]); {6034#false} is VALID [2022-02-20 23:55:57,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {6109#(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); {6034#false} is VALID [2022-02-20 23:55:57,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem13#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {6109#(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:55:57,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {6117#(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.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1046-2 {6113#(and (= |ULTIMATE.start_main_~null~0#1.offset| |ULTIMATE.start_main_#t~mem13#1.offset|) (= |ULTIMATE.start_main_~null~0#1.base| |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:55:57,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {6117#(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~mem10#1);havoc main_#t~mem10#1; {6117#(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:55:57,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {6117#(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~mem10#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1046 {6117#(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:55:57,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {6117#(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); {6117#(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:55:57,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {6117#(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; {6117#(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:55:57,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {6117#(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~mem9#1);havoc main_#t~mem9#1; {6117#(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:55:57,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {6117#(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~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {6117#(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:55:57,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {6117#(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; {6117#(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:55:57,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {6117#(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); {6117#(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:55:57,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {6145#(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; {6117#(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:55:57,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {6145#(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; {6145#(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:55:57,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {6145#(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; {6145#(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:55:57,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {6145#(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(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {6145#(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:55:57,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {6033#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: L1010 {6145#(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:55:57,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {6033#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {6033#true} is VALID [2022-02-20 23:55:57,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {6033#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {6033#true} is VALID [2022-02-20 23:55:57,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {6033#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {6033#true} is VALID [2022-02-20 23:55:57,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {6033#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {6033#true} is VALID [2022-02-20 23:55:57,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {6033#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); {6033#true} is VALID [2022-02-20 23:55:57,090 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:55:57,090 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:57,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593056808] [2022-02-20 23:55:57,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593056808] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:55:57,091 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:55:57,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-02-20 23:55:57,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673574500] [2022-02-20 23:55:57,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:55:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 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 22 [2022-02-20 23:55:57,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:57,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:57,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:55:57,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:55:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:55:57,135 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,687 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2022-02-20 23:55:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:55:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 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 22 [2022-02-20 23:55:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2022-02-20 23:55:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2022-02-20 23:55:58,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 172 transitions. [2022-02-20 23:55:58,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:58,867 INFO L225 Difference]: With dead ends: 177 [2022-02-20 23:55:58,867 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 23:55:58,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:55:58,868 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 247 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:58,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 290 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:55:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 23:55:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 133. [2022-02-20 23:55:58,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:58,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,870 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,870 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,872 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2022-02-20 23:55:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2022-02-20 23:55:58,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 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:55:58,873 INFO L87 Difference]: Start difference. First operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 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:55:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,875 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2022-02-20 23:55:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2022-02-20 23:55:58,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:58,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 132 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-02-20 23:55:58,877 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 22 [2022-02-20 23:55:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:58,877 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-02-20 23:55:58,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-02-20 23:55:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:55:58,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:58,878 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] [2022-02-20 23:55:58,894 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:55:59,085 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:55:59,085 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:55:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2015269624, now seen corresponding path program 1 times [2022-02-20 23:55:59,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:59,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831867593] [2022-02-20 23:55:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:59,087 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:55:59,089 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:55:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:59,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:55:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:59,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:59,188 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:55:59,285 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:55:59,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#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); {6842#true} is VALID [2022-02-20 23:55:59,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {6842#true} is VALID [2022-02-20 23:55:59,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {6842#true} is VALID [2022-02-20 23:55:59,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {6842#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {6842#true} is VALID [2022-02-20 23:55:59,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {6859#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:59,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {6859#(= |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: L1010 {6859#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:55:59,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {6859#(= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {6866#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:59,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {6866#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {6866#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:59,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {6866#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6866#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:55:59,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {6866#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {6876#(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 (_ bv4 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); {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {6876#(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 (_ bv4 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); {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:55:59,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {6876#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem10#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1046 {6898#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 23:55:59,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {6898#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume ~unnamed1~0~RED == main_#t~mem10#1;havoc main_#t~mem10#1; {6843#false} is VALID [2022-02-20 23:55:59,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {6843#false} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1048 {6843#false} is VALID [2022-02-20 23:55:59,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {6843#false} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {6843#false} is VALID [2022-02-20 23:55:59,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {6843#false} assume !(main_~null~0#1.base != main_~end~0#1.base || main_~null~0#1.offset != main_~end~0#1.offset); {6843#false} is VALID [2022-02-20 23:55:59,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {6843#false} assume !false; {6843#false} is VALID [2022-02-20 23:55:59,310 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:55:59,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:59,310 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:59,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831867593] [2022-02-20 23:55:59,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831867593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:59,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:59,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:59,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722848427] [2022-02-20 23:55:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:59,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:55:59,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:59,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:59,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:59,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:59,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:59,334 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:00,206 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2022-02-20 23:56:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:56:00,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:56:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-02-20 23:56:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-02-20 23:56:00,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2022-02-20 23:56:00,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:00,337 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:56:00,337 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:56:00,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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:56:00,338 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 112 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:00,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 272 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:56:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:56:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2022-02-20 23:56:00,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:00,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,340 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,340 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:00,342 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2022-02-20 23:56:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2022-02-20 23:56:00,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:00,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:00,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 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:56:00,343 INFO L87 Difference]: Start difference. First operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 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:56:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:00,344 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2022-02-20 23:56:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2022-02-20 23:56:00,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:00,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:00,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:00,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-02-20 23:56:00,347 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2022-02-20 23:56:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:00,347 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-02-20 23:56:00,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:56:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:56:00,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:00,347 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] [2022-02-20 23:56:00,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-02-20 23:56:00,554 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:56:00,554 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:56:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1383851026, now seen corresponding path program 1 times [2022-02-20 23:56:00,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:00,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799887434] [2022-02-20 23:56:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:00,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:00,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:00,556 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:56:00,558 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:56:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:00,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:56:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:00,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:00,725 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:56:00,738 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:56:00,763 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:56:00,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {7521#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); {7521#true} is VALID [2022-02-20 23:56:00,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {7521#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {7521#true} is VALID [2022-02-20 23:56:00,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {7521#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {7521#true} is VALID [2022-02-20 23:56:00,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {7521#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {7521#true} is VALID [2022-02-20 23:56:00,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {7521#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {7521#true} is VALID [2022-02-20 23:56:00,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {7521#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: L1010 {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {7521#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {7521#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {7521#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(8bv32); {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {7521#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, 4bv32); srcloc: L1019 {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {7521#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {7521#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, 4bv32); srcloc: L1020 {7521#true} is VALID [2022-02-20 23:56:00,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {7521#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {7521#true} is VALID [2022-02-20 23:56:00,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {7521#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, 4bv32); srcloc: L1021 {7521#true} is VALID [2022-02-20 23:56:00,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {7521#true} assume !(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {7521#true} is VALID [2022-02-20 23:56:00,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {7521#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~RED, main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1029 {7521#true} is VALID [2022-02-20 23:56:00,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {7521#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8bv32); {7574#(= (select |#valid| |ULTIMATE.start_main_#t~malloc7#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:00,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {7574#(= (select |#valid| |ULTIMATE.start_main_#t~malloc7#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1030 {7578#(= (_ 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:56:00,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {7578#(= (_ 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~malloc7#1.base, main_#t~malloc7#1.offset; {7578#(= (_ 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:56:00,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#(= (_ 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~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1031 {7585#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|))} is VALID [2022-02-20 23:56:00,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {7585#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7589#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:56:00,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {7589#(= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~end~0#1.base]); {7522#false} is VALID [2022-02-20 23:56:00,784 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:56:00,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:00,784 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:00,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799887434] [2022-02-20 23:56:00,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799887434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:00,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:00,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:56:00,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418334629] [2022-02-20 23:56:00,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:56:00,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:00,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:00,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:00,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:56:00,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:56:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:56:00,815 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:01,746 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:56:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:56:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:56:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:56:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:56:01,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-02-20 23:56:01,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:01,837 INFO L225 Difference]: With dead ends: 133 [2022-02-20 23:56:01,837 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 23:56:01,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:56:01,838 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:01,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 248 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:56:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 23:56:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2022-02-20 23:56:01,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:01,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,840 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,840 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:01,841 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:56:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:56:01,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:01,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:01,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 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 133 states. [2022-02-20 23:56:01,842 INFO L87 Difference]: Start difference. First operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 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 133 states. [2022-02-20 23:56:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:01,844 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:56:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:56:01,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:01,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:01,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:01,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-02-20 23:56:01,846 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 22 [2022-02-20 23:56:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:01,846 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-02-20 23:56:01,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-02-20 23:56:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:56:01,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:01,847 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] [2022-02-20 23:56:01,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:02,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:02,056 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:56:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1383851027, now seen corresponding path program 1 times [2022-02-20 23:56:02,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:02,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868159338] [2022-02-20 23:56:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:02,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:02,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:02,058 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:02,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:56:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:02,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:56:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:02,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:02,213 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:56:02,233 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:56:02,238 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:56:02,261 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:56:02,264 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:56:02,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {8131#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); {8131#true} is VALID [2022-02-20 23:56:02,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {8131#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {8131#true} is VALID [2022-02-20 23:56:02,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {8131#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {8131#true} is VALID [2022-02-20 23:56:02,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {8131#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {8131#true} is VALID [2022-02-20 23:56:02,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {8131#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {8131#true} is VALID [2022-02-20 23:56:02,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {8131#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: L1010 {8131#true} is VALID [2022-02-20 23:56:02,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {8131#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {8131#true} main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {8131#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(8bv32); {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {8131#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, 4bv32); srcloc: L1019 {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {8131#true} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {8131#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, 4bv32); srcloc: L1020 {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {8131#true} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {8131#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, 4bv32); srcloc: L1021 {8131#true} is VALID [2022-02-20 23:56:02,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {8131#true} assume !(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {8131#true} is VALID [2022-02-20 23:56:02,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {8131#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~RED, main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1029 {8131#true} is VALID [2022-02-20 23:56:02,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {8131#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8bv32); {8184#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~malloc7#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)))} is VALID [2022-02-20 23:56:02,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {8184#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~malloc7#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1030 {8188#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (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:56:02,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {8188#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {8188#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (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:56:02,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {8188#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1031 {8195#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} is VALID [2022-02-20 23:56:02,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {8195#(and (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {8199#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:02,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {8199#(and (= (select |#length| |ULTIMATE.start_main_~end~0#1.base|) (_ bv8 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)); {8132#false} is VALID [2022-02-20 23:56:02,298 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:56:02,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:02,299 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:02,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868159338] [2022-02-20 23:56:02,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868159338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:02,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:02,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:56:02,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242388964] [2022-02-20 23:56:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:56:02,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:02,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:02,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:02,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:56:02,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:56:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:56:02,323 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:03,307 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:56:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:56:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 23:56:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:56:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:56:03,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-02-20 23:56:03,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:03,390 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:56:03,390 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:56:03,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:56:03,391 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 8 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:03,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 301 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:56:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:56:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2022-02-20 23:56:03,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:03,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,397 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,397 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:03,399 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:56:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:56:03,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:03,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:03,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:56:03,399 INFO L87 Difference]: Start difference. First operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 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 130 states. [2022-02-20 23:56:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:03,401 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:56:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:56:03,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:03,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:03,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:03,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.35) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2022-02-20 23:56:03,403 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 22 [2022-02-20 23:56:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:03,403 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2022-02-20 23:56:03,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2022-02-20 23:56:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:56:03,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:03,404 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] [2022-02-20 23:56:03,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:03,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:03,605 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:56:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash 99452763, now seen corresponding path program 1 times [2022-02-20 23:56:03,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:03,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056872594] [2022-02-20 23:56:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:03,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:03,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:03,619 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:03,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:56:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:03,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:56:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:03,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:03,771 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:56:03,795 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:56:03,856 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:56:03,857 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:56:03,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:56:03,915 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:56:03,926 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:56:03,976 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 16 treesize of output 8 [2022-02-20 23:56:04,030 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 16 treesize of output 18 [2022-02-20 23:56:04,067 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 16 treesize of output 18 [2022-02-20 23:56:04,129 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:56:04,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {8720#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); {8720#true} is VALID [2022-02-20 23:56:04,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {8720#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {8720#true} is VALID [2022-02-20 23:56:04,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {8720#true} is VALID [2022-02-20 23:56:04,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {8720#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {8720#true} is VALID [2022-02-20 23:56:04,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {8720#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {8737#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:04,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {8737#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |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: L1010 {8737#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:56:04,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {8737#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {8744#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {8744#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {8748#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {8748#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32); {8752#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {8752#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_#t~malloc4#1.base|)) (= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} 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: L1019 {8756#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {8756#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8756#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {8756#(and (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|) (not (= |ULTIMATE.start_main_~list~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_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~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: L1020 {8763#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {8763#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8767#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {8767#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} 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, 4bv32); srcloc: L1021 {8767#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {8767#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} assume 0bv32 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {8767#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {8767#(and (not (= |ULTIMATE.start_main_~list~0#1.base| |ULTIMATE.start_main_~end~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1025 {8777#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {8777#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8777#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {8777#(and (= |ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {8784#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:56:04,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {8784#(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 (_ bv4 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); {8784#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:56:04,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {8784#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {8784#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 23:56:04,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {8784#(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 (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))))} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {8794#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:56:04,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {8794#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {8721#false} is VALID [2022-02-20 23:56:04,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-02-20 23:56:04,158 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:56:04,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:56:04,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-02-20 23:56:04,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-02-20 23:56:04,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-02-20 23:56:04,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-02-20 23:56:04,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32)) (v_ArrVal_484 (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|))))) is different from false [2022-02-20 23:56:04,369 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-02-20 23:56:04,370 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-02-20 23:56:04,375 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 36 treesize of output 24 [2022-02-20 23:56:04,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-02-20 23:56:04,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-02-20 23:56:04,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {8794#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {8721#false} is VALID [2022-02-20 23:56:04,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {8807#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {8794#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem9#1|)} is VALID [2022-02-20 23:56:04,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {8807#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {8807#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:56:04,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {8807#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 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); {8807#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:56:04,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {8817#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {8807#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 23:56:04,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {8817#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8817#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:04,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {8824#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1025 {8817#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:04,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {8824#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} assume 0bv32 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {8824#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,427 WARN L290 TraceCheckUtils]: 13: Hoare triple {8824#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} 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, 4bv32); srcloc: L1021 {8824#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is UNKNOWN [2022-02-20 23:56:04,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {8834#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {8824#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {8838#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~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: L1020 {8834#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {8838#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8838#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {8845#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} 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: L1019 {8838#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32)))) (= ~unnamed1~0~BLACK (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is VALID [2022-02-20 23:56:04,436 WARN L290 TraceCheckUtils]: 8: Hoare triple {8849#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) (_ bv0 1))) (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))))} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32); {8845#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))} is UNKNOWN [2022-02-20 23:56:04,439 WARN L290 TraceCheckUtils]: 7: Hoare triple {8853#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32)) (v_ArrVal_484 (_ BitVec 32))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~list~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {8849#(forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) (_ bv0 1))) (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_484 (_ BitVec 32))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|))))))} is UNKNOWN [2022-02-20 23:56:04,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {8857#(not (= (_ bv0 1) (bvneg (select |#valid| |ULTIMATE.start_main_~list~0#1.base|))))} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {8853#(forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| (_ BitVec 32)) (v_ArrVal_484 (_ BitVec 32))) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~list~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_484)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_486) |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))))} is VALID [2022-02-20 23:56:04,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {8857#(not (= (_ bv0 1) (bvneg (select |#valid| |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, 4bv32); srcloc: L1010 {8857#(not (= (_ bv0 1) (bvneg (select |#valid| |ULTIMATE.start_main_~list~0#1.base|))))} is VALID [2022-02-20 23:56:04,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {8720#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {8857#(not (= (_ bv0 1) (bvneg (select |#valid| |ULTIMATE.start_main_~list~0#1.base|))))} is VALID [2022-02-20 23:56:04,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {8720#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {8720#true} is VALID [2022-02-20 23:56:04,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {8720#true} is VALID [2022-02-20 23:56:04,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {8720#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {8720#true} is VALID [2022-02-20 23:56:04,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {8720#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); {8720#true} is VALID [2022-02-20 23:56:04,442 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:56:04,442 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:04,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056872594] [2022-02-20 23:56:04,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056872594] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:56:04,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:56:04,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-02-20 23:56:04,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378056356] [2022-02-20 23:56:04,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:56:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 23 [2022-02-20 23:56:04,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:04,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:04,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:04,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 23:56:04,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 23:56:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=188, Unknown=5, NotChecked=160, Total=420 [2022-02-20 23:56:04,500 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:06,338 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2022-02-20 23:56:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:56:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 23 [2022-02-20 23:56:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 193 transitions. [2022-02-20 23:56:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 193 transitions. [2022-02-20 23:56:06,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 193 transitions. [2022-02-20 23:56:06,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:06,521 INFO L225 Difference]: With dead ends: 200 [2022-02-20 23:56:06,521 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 23:56:06,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=346, Unknown=5, NotChecked=220, Total=702 [2022-02-20 23:56:06,521 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 172 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:06,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 464 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 355 Invalid, 0 Unknown, 731 Unchecked, 0.6s Time] [2022-02-20 23:56:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 23:56:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2022-02-20 23:56:06,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:06,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,524 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,524 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:06,528 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2022-02-20 23:56:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2022-02-20 23:56:06,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:06,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:06,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:56:06,529 INFO L87 Difference]: Start difference. First operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:56:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:06,531 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2022-02-20 23:56:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2022-02-20 23:56:06,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:06,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:06,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:06,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2022-02-20 23:56:06,533 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 23 [2022-02-20 23:56:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:06,534 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2022-02-20 23:56:06,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2022-02-20 23:56:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:56:06,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:06,535 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:56:06,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-02-20 23:56:06,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:06,745 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:56:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1633911312, now seen corresponding path program 1 times [2022-02-20 23:56:06,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:06,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274410374] [2022-02-20 23:56:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:06,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:06,772 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:06,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:56:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:06,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:56:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:06,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:06,879 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:56:06,947 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:56:06,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {9629#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); {9629#true} is VALID [2022-02-20 23:56:06,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {9629#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {9629#true} is VALID [2022-02-20 23:56:06,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {9629#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {9629#true} is VALID [2022-02-20 23:56:06,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {9629#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {9629#true} is VALID [2022-02-20 23:56:06,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {9629#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {9629#true} is VALID [2022-02-20 23:56:06,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {9629#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: L1010 {9629#true} is VALID [2022-02-20 23:56:06,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {9629#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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); {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} goto; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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); {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem10#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1046 {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1046-2 {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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); {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |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); {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 23:56:06,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {9652#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1 := read~intINTTYPE4(main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1059 {9701#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem14#1|)} is VALID [2022-02-20 23:56:06,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {9701#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem14#1|)} assume ~unnamed1~0~RED == main_#t~mem14#1;havoc main_#t~mem14#1; {9630#false} is VALID [2022-02-20 23:56:06,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {9630#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1061 {9630#false} is VALID [2022-02-20 23:56:06,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {9630#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; {9630#false} is VALID [2022-02-20 23:56:06,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {9630#false} assume 0bv32 == main_~list~0#1.offset; {9630#false} is VALID [2022-02-20 23:56:06,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {9630#false} assume !~bvult32(main_~list~0#1.base, #StackHeapBarrier); {9630#false} is VALID [2022-02-20 23:56:06,976 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:56:06,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:06,977 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:06,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274410374] [2022-02-20 23:56:06,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274410374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:06,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:06,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:56:06,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175528362] [2022-02-20 23:56:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:06,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:06,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:06,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:07,007 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:56:07,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:56:07,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:56:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:56:07,008 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:07,459 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-02-20 23:56:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:56:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-02-20 23:56:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-02-20 23:56:07,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-02-20 23:56:07,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:07,560 INFO L225 Difference]: With dead ends: 146 [2022-02-20 23:56:07,560 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 23:56:07,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:56:07,561 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:07,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:56:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 23:56:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-02-20 23:56:07,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:07,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:07,563 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:07,563 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:07,565 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-02-20 23:56:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-02-20 23:56:07,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:07,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:07,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 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 146 states. [2022-02-20 23:56:07,565 INFO L87 Difference]: Start difference. First operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 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 146 states. [2022-02-20 23:56:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:07,567 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-02-20 23:56:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-02-20 23:56:07,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:07,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:07,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:07,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-02-20 23:56:07,568 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 28 [2022-02-20 23:56:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:07,569 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-02-20 23:56:07,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:56:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-02-20 23:56:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:56:07,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:07,570 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:56:07,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:07,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:07,770 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:56:07,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1612916602, now seen corresponding path program 1 times [2022-02-20 23:56:07,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:07,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567486222] [2022-02-20 23:56:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:07,788 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:07,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:56:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:07,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:56:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:07,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:56:07,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {10296#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); {10296#true} is VALID [2022-02-20 23:56:07,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {10296#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~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#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(8bv32);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; {10296#true} is VALID [2022-02-20 23:56:07,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {10296#true} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~null~0#1.base, ~bvadd32(4bv32, main_~null~0#1.offset), 4bv32); srcloc: L1006 {10296#true} is VALID [2022-02-20 23:56:07,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {10296#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~null~0#1.base, main_~null~0#1.offset, 4bv32); srcloc: L1006-1 {10296#true} is VALID [2022-02-20 23:56:07,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {10296#true} call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(8bv32);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; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {10313#(bvult |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, 4bv32); srcloc: L1010 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1010-1 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {10313#(bvult |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; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {10313#(bvult |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; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {10313#(bvult |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); {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} goto; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem9#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1042-4 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !!(~unnamed1~0~BLACK == main_#t~mem9#1);havoc main_#t~mem9#1; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} goto; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {10313#(bvult |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); {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem10#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(4bv32, main_~end~0#1.offset), 4bv32); srcloc: L1046 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(~unnamed1~0~RED == main_#t~mem10#1);havoc main_#t~mem10#1; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32); srcloc: L1046-2 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {10313#(bvult |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); {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {10313#(bvult |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); {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem14#1 := read~intINTTYPE4(main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32); srcloc: L1059 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !(~unnamed1~0~RED == main_#t~mem14#1);havoc main_#t~mem14#1; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~list~0#1.base, main_~list~0#1.offset, 4bv32); srcloc: L1068 {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {10313#(bvult |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; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume 0bv32 == main_~list~0#1.offset; {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:56:07,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {10313#(bvult |ULTIMATE.start_main_~list~0#1.base| |#StackHeapBarrier|)} assume !~bvult32(main_~list~0#1.base, #StackHeapBarrier); {10297#false} is VALID [2022-02-20 23:56:07,975 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:56:07,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:56:07,975 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:56:07,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567486222] [2022-02-20 23:56:07,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567486222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:56:07,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:56:07,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:56:07,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971595446] [2022-02-20 23:56:07,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:56:07,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:07,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:56:07,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:08,004 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:56:08,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:56:08,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:56:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:56:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:56:08,005 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:08,216 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-02-20 23:56:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:56:08,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:56:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:56:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 23:56:08,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 23:56:08,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:56:08,317 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:56:08,317 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:56:08,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:56:08,318 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:56:08,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:56:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:56:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-20 23:56:08,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:56:08,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:08,320 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:08,320 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:08,322 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-02-20 23:56:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-02-20 23:56:08,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:08,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:08,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 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 141 states. [2022-02-20 23:56:08,322 INFO L87 Difference]: Start difference. First operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 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 141 states. [2022-02-20 23:56:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:56:08,324 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-02-20 23:56:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-02-20 23:56:08,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:56:08,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:56:08,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:56:08,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:56:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:56:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2022-02-20 23:56:08,325 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 28 [2022-02-20 23:56:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:56:08,325 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2022-02-20 23:56:08,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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:56:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-02-20 23:56:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:56:08,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:56:08,326 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] [2022-02-20 23:56:08,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:08,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:08,527 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 57 more)] === [2022-02-20 23:56:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -556753399, now seen corresponding path program 1 times [2022-02-20 23:56:08,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:08,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625667963] [2022-02-20 23:56:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:08,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:08,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:08,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:08,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:56:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:08,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:56:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:56:08,664 INFO L286 TraceCheckSpWp]: Computing forward predicates...