./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:50:54,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:50:54,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:50:54,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:50:54,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:50:54,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:50:54,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:50:54,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:50:54,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:50:54,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:50:54,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:50:54,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:50:54,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:50:54,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:50:54,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:50:54,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:50:54,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:50:54,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:50:54,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:50:54,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:50:54,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:50:54,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:50:54,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:50:54,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:50:54,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:50:54,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:50:54,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:50:54,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:50:54,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:50:54,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:50:54,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:50:54,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:50:54,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:50:54,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:50:54,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:50:54,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:50:54,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:50:54,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:50:54,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:50:54,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:50:54,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:50:54,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:50:54,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:50:54,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:50:54,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:50:54,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:50:54,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:50:54,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:50:54,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:50:54,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:50:54,637 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:50:54,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:50:54,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:50:54,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:50:54,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:50:54,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:50:54,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:50:54,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:50:54,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:50:54,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:50:54,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:54,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:50:54,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:50:54,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:50:54,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:50:54,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:50:54,641 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:50:54,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:50:54,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:50:54,641 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 ! call(reach_error())) ) 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-02-20 16:50:54,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:50:54,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:50:54,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:50:54,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:50:54,840 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:50:54,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-02-20 16:50:54,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73134755c/86d3ab99dbed4d99b7a0035122a6fe3e/FLAGf6e2b0e97 [2022-02-20 16:50:55,306 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:50:55,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-02-20 16:50:55,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73134755c/86d3ab99dbed4d99b7a0035122a6fe3e/FLAGf6e2b0e97 [2022-02-20 16:50:55,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73134755c/86d3ab99dbed4d99b7a0035122a6fe3e [2022-02-20 16:50:55,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:50:55,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:50:55,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:55,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:50:55,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:50:55,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdfc2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55, skipping insertion in model container [2022-02-20 16:50:55,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:50:55,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:50:55,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2022-02-20 16:50:55,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2022-02-20 16:50:55,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2022-02-20 16:50:55,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2022-02-20 16:50:55,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2022-02-20 16:50:55,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2022-02-20 16:50:55,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2022-02-20 16:50:55,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:55,597 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:50:55,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2022-02-20 16:50:55,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2022-02-20 16:50:55,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2022-02-20 16:50:55,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2022-02-20 16:50:55,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2022-02-20 16:50:55,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2022-02-20 16:50:55,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2022-02-20 16:50:55,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:55,667 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:50:55,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55 WrapperNode [2022-02-20 16:50:55,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:55,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:55,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:50:55,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:50:55,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,719 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2022-02-20 16:50:55,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:55,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:50:55,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:50:55,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:50:55,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:50:55,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:50:55,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:50:55,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:50:55,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (1/1) ... [2022-02-20 16:50:55,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:55,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:55,790 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 16:50:55,797 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 16:50:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:50:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:50:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:50:55,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:50:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:50:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:50:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:50:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:50:55,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:50:55,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:50:55,901 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:50:55,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:50:56,192 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:50:56,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:50:56,197 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 16:50:56,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:56 BoogieIcfgContainer [2022-02-20 16:50:56,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:50:56,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:50:56,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:50:56,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:50:56,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:50:55" (1/3) ... [2022-02-20 16:50:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2540fbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:56, skipping insertion in model container [2022-02-20 16:50:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:55" (2/3) ... [2022-02-20 16:50:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2540fbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:56, skipping insertion in model container [2022-02-20 16:50:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:56" (3/3) ... [2022-02-20 16:50:56,204 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-02-20 16:50:56,207 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:50:56,208 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 16:50:56,238 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:50:56,242 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:50:56,242 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 16:50:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 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 16:50:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:50:56,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:56,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:50:56,264 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2022-02-20 16:50:56,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:56,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871005338] [2022-02-20 16:50:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:56,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#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(19, 2); {50#true} is VALID [2022-02-20 16:50:56,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {50#true} is VALID [2022-02-20 16:50:56,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {50#true} assume !true; {51#false} is VALID [2022-02-20 16:50:56,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#false} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {51#false} is VALID [2022-02-20 16:50:56,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {51#false} is VALID [2022-02-20 16:50:56,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#false} assume !false; {51#false} is VALID [2022-02-20 16:50:56,426 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 16:50:56,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:56,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871005338] [2022-02-20 16:50:56,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871005338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:56,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:56,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:50:56,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832597701] [2022-02-20 16:50:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:56,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:56,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,448 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 16:50:56,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:50:56,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:50:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:50:56,467 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:56,552 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2022-02-20 16:50:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:50:56,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 150 transitions. [2022-02-20 16:50:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 150 transitions. [2022-02-20 16:50:56,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 150 transitions. [2022-02-20 16:50:56,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:56,712 INFO L225 Difference]: With dead ends: 92 [2022-02-20 16:50:56,712 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:50:56,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:50:56,717 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:56,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:50:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 16:50:56,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:56,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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 16:50:56,739 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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 16:50:56,739 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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 16:50:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:56,742 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 16:50:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 16:50:56,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:56,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:56,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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) Second operand 41 states. [2022-02-20 16:50:56,745 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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) Second operand 41 states. [2022-02-20 16:50:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:56,748 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-02-20 16:50:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 16:50:56,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:56,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:56,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:56,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 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 16:50:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-02-20 16:50:56,752 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2022-02-20 16:50:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:56,754 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-02-20 16:50:56,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:50:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 16:50:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:50:56,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:56,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:56,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:50:56,758 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2022-02-20 16:50:56,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:56,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879830897] [2022-02-20 16:50:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:56,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#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(19, 2); {280#true} is VALID [2022-02-20 16:50:56,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {282#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:50:56,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {282#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:50:56,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {282#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:50:56,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {282#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {283#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} is VALID [2022-02-20 16:50:56,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {281#false} is VALID [2022-02-20 16:50:56,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#false} assume !false; {281#false} is VALID [2022-02-20 16:50:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:56,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:56,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879830897] [2022-02-20 16:50:56,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879830897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:56,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:56,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:56,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945060513] [2022-02-20 16:50:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:56,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:56,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:56,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:56,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:56,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:56,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:56,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:56,840 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:56,943 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-20 16:50:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:56,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 16:50:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 16:50:56,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 16:50:56,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:56,982 INFO L225 Difference]: With dead ends: 44 [2022-02-20 16:50:56,982 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:50:56,983 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 16:50:56,984 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:56,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:50:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-02-20 16:50:56,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:56,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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 16:50:56,987 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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 16:50:56,987 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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 16:50:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:56,988 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 16:50:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 16:50:56,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:56,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:56,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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) Second operand 40 states. [2022-02-20 16:50:56,989 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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) Second operand 40 states. [2022-02-20 16:50:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:56,990 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 16:50:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 16:50:56,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:56,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:56,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:56,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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 16:50:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-02-20 16:50:56,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2022-02-20 16:50:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:56,993 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-02-20 16:50:56,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-02-20 16:50:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:50:56,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:56,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:56,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:50:56,994 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2022-02-20 16:50:56,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:56,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033829617] [2022-02-20 16:50:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:57,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#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(19, 2); {455#true} is VALID [2022-02-20 16:50:57,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {455#true} is VALID [2022-02-20 16:50:57,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {455#true} is VALID [2022-02-20 16:50:57,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {455#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~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;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {455#true} is VALID [2022-02-20 16:50:57,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#true} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {457#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:57,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {458#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:50:57,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {456#false} is VALID [2022-02-20 16:50:57,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#false} assume !false; {456#false} is VALID [2022-02-20 16:50:57,114 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 16:50:57,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:57,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033829617] [2022-02-20 16:50:57,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033829617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:57,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:57,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:57,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990045906] [2022-02-20 16:50:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 16:50:57,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:57,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:57,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:57,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:57,127 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,234 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-20 16:50:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 16:50:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-02-20 16:50:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-02-20 16:50:57,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-02-20 16:50:57,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:57,265 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:50:57,265 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 16:50:57,265 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 16:50:57,266 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:57,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 16:50:57,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 16:50:57,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:57,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,288 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,288 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,289 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 16:50:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 16:50:57,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:57,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:57,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 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 35 states. [2022-02-20 16:50:57,290 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 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 35 states. [2022-02-20 16:50:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,290 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 16:50:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 16:50:57,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:57,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:57,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:57,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-02-20 16:50:57,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2022-02-20 16:50:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:57,292 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-02-20 16:50:57,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-02-20 16:50:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:50:57,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:57,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:57,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:50:57,293 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2022-02-20 16:50:57,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:57,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823823811] [2022-02-20 16:50:57,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:57,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {611#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(19, 2); {611#true} is VALID [2022-02-20 16:50:57,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {611#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {613#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:57,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {613#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:57,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {613#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {613#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:57,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {613#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {614#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:57,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {614#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:57,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {614#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:57,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {615#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} is VALID [2022-02-20 16:50:57,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {615#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {612#false} is VALID [2022-02-20 16:50:57,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {612#false} assume !false; {612#false} is VALID [2022-02-20 16:50:57,398 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 16:50:57,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:57,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823823811] [2022-02-20 16:50:57,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823823811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:57,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:57,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:50:57,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75179839] [2022-02-20 16:50:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:57,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:57,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,406 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 16:50:57,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:50:57,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:50:57,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:50:57,408 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,599 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-02-20 16:50:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:50:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-02-20 16:50:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-02-20 16:50:57,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-02-20 16:50:57,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:57,655 INFO L225 Difference]: With dead ends: 60 [2022-02-20 16:50:57,656 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 16:50:57,656 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 16:50:57,656 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:57,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 88 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:50:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 16:50:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-02-20 16:50:57,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:57,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,660 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,660 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,661 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-02-20 16:50:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-02-20 16:50:57,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:57,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:57,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2022-02-20 16:50:57,662 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2022-02-20 16:50:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,663 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-02-20 16:50:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-02-20 16:50:57,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:57,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:57,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:57,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 16:50:57,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 10 [2022-02-20 16:50:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:57,665 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 16:50:57,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 16:50:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 16:50:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:50:57,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:57,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:57,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:50:57,665 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2022-02-20 16:50:57,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:57,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488715047] [2022-02-20 16:50:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:57,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {851#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(19, 2); {851#true} is VALID [2022-02-20 16:50:57,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {851#true} is VALID [2022-02-20 16:50:57,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {851#true} is VALID [2022-02-20 16:50:57,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {851#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~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;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {851#true} is VALID [2022-02-20 16:50:57,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {851#true} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:57,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:57,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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~mem10#1);havoc main_#t~mem10#1; {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:57,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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; {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:57,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {854#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} is VALID [2022-02-20 16:50:57,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {854#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} assume !(0 == main_#t~mem11#1.base && 0 == main_#t~mem11#1.offset);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {852#false} is VALID [2022-02-20 16:50:57,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-02-20 16:50:57,801 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 16:50:57,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:57,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488715047] [2022-02-20 16:50:57,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488715047] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:57,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:57,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:57,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084249075] [2022-02-20 16:50:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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 16:50:57,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:57,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) 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 16:50:57,811 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 16:50:57,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:57,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:57,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:57,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:57,811 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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 16:50:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,955 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 16:50:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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 16:50:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) 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 16:50:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:50:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) 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 16:50:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:50:57,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:50:57,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:57,989 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:50:57,990 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:50:57,990 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 16:50:57,990 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:57,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 70 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:50:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:50:57,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:57,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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 16:50:57,994 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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 16:50:57,994 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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 16:50:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,995 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 16:50:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 16:50:57,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:57,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:57,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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) Second operand 40 states. [2022-02-20 16:50:57,996 INFO L87 Difference]: Start difference. First operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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) Second operand 40 states. [2022-02-20 16:50:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:57,996 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 16:50:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 16:50:57,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:57,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:57,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:57,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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 16:50:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-20 16:50:57,998 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2022-02-20 16:50:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:57,999 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-20 16:50:57,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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 16:50:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 16:50:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:50:57,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:57,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:58,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:50:58,000 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2022-02-20 16:50:58,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:58,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723420046] [2022-02-20 16:50:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:58,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {1031#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(19, 2); {1031#true} is VALID [2022-02-20 16:50:58,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1031#true} is VALID [2022-02-20 16:50:58,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1031#true} is VALID [2022-02-20 16:50:58,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {1031#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1031#true} is VALID [2022-02-20 16:50:58,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {1031#true} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1031#true} is VALID [2022-02-20 16:50:58,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1031#true} is VALID [2022-02-20 16:50:58,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#true} goto; {1031#true} is VALID [2022-02-20 16:50:58,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#true} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1033#(= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem12#1|)} is VALID [2022-02-20 16:50:58,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#(= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem12#1|)} assume !!(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {1034#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:58,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {1034#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {1034#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:58,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {1034#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1035#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem13#1|)} is VALID [2022-02-20 16:50:58,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem13#1|)} assume ~unnamed1~0~RED == main_#t~mem13#1;havoc main_#t~mem13#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {1032#false} is VALID [2022-02-20 16:50:58,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1032#false} is VALID [2022-02-20 16:50:58,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#false} assume !false; {1032#false} is VALID [2022-02-20 16:50:58,081 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 16:50:58,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:58,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723420046] [2022-02-20 16:50:58,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723420046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:58,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:58,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:50:58,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009423230] [2022-02-20 16:50:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:50:58,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:58,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,090 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 16:50:58,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:50:58,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:50:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:50:58,091 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,249 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 16:50:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:50:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:50:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:50:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:50:58,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:50:58,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:58,286 INFO L225 Difference]: With dead ends: 55 [2022-02-20 16:50:58,286 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:50:58,286 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 16:50:58,289 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:58,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:50:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:50:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-02-20 16:50:58,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:58,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,297 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,297 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,298 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 16:50:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 16:50:58,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 16:50:58,298 INFO L87 Difference]: Start difference. First operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 16:50:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,299 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 16:50:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-20 16:50:58,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:58,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 16:50:58,300 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2022-02-20 16:50:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:58,300 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 16:50:58,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 16:50:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:50:58,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:58,301 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:58,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:50:58,301 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2022-02-20 16:50:58,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:58,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293368816] [2022-02-20 16:50:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {1234#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(19, 2); {1234#true} is VALID [2022-02-20 16:50:58,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {1234#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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~mem12#1);havoc main_#t~mem12#1; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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~mem13#1);havoc main_#t~mem13#1; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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))} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {1238#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 16:50:58,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1238#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1235#false} is VALID [2022-02-20 16:50:58,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#false} assume ~unnamed1~0~RED == main_#t~mem13#1;havoc main_#t~mem13#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {1235#false} is VALID [2022-02-20 16:50:58,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1235#false} is VALID [2022-02-20 16:50:58,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#false} assume !false; {1235#false} is VALID [2022-02-20 16:50:58,362 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 16:50:58,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:58,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293368816] [2022-02-20 16:50:58,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293368816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:50:58,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191867307] [2022-02-20 16:50:58,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:58,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:50:58,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:58,365 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 16:50:58,383 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 16:50:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 16:50:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:50:58,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:58,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:58,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 16:50:58,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:58,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:58,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:58,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 16:50:58,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 16:50:58,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:50:58,821 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-02-20 16:50:58,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {1234#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(19, 2); {1234#true} is VALID [2022-02-20 16:50:58,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {1234#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1245#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1245#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {1245#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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~nondet2#1);havoc main_#t~nondet2#1; {1245#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {1245#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} goto; {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !!(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} goto; {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !(~unnamed1~0~RED == main_#t~mem13#1);havoc main_#t~mem13#1; {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:50:58,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {1255#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0) (= |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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (+ 4 |ULTIMATE.start_main_~end~0#1.offset|)) 0))} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {1238#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 16:50:58,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {1238#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1235#false} is VALID [2022-02-20 16:50:58,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#false} assume ~unnamed1~0~RED == main_#t~mem13#1;havoc main_#t~mem13#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {1235#false} is VALID [2022-02-20 16:50:58,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1235#false} is VALID [2022-02-20 16:50:58,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#false} assume !false; {1235#false} is VALID [2022-02-20 16:50:58,837 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 16:50:58,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:50:58,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#false} assume !false; {1235#false} is VALID [2022-02-20 16:50:58,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {1235#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1235#false} is VALID [2022-02-20 16:50:58,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {1235#false} assume ~unnamed1~0~RED == main_#t~mem13#1;havoc main_#t~mem13#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {1235#false} is VALID [2022-02-20 16:50:58,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1238#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1235#false} is VALID [2022-02-20 16:50:58,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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))} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {1238#(and (= |ULTIMATE.start_main_~end~0#1.base| 0) (= |ULTIMATE.start_main_~end~0#1.offset| 0))} is VALID [2022-02-20 16:50:58,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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~mem13#1);havoc main_#t~mem13#1; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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~mem12#1);havoc main_#t~mem12#1; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1237#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |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 16:50:58,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1234#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1236#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|) 0) (= (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 16:50:58,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {1234#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(19, 2); {1234#true} is VALID [2022-02-20 16:50:58,980 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 16:50:58,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191867307] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:50:58,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:50:58,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-02-20 16:50:58,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149991917] [2022-02-20 16:50:58,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:50:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 17 [2022-02-20 16:50:58,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:58,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 16:50:58,999 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 16:50:58,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:50:58,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:50:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:50:59,000 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 16:50:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:59,263 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-02-20 16:50:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:50:59,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 17 [2022-02-20 16:50:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 16:50:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-02-20 16:50:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 16:50:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-02-20 16:50:59,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-02-20 16:50:59,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:59,307 INFO L225 Difference]: With dead ends: 59 [2022-02-20 16:50:59,307 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:50:59,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:50:59,308 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:59,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 103 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:50:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:50:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 16:50:59,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:59,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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 16:50:59,310 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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 16:50:59,311 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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 16:50:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:59,311 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-20 16:50:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-02-20 16:50:59,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:59,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:59,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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) Second operand 37 states. [2022-02-20 16:50:59,314 INFO L87 Difference]: Start difference. First operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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) Second operand 37 states. [2022-02-20 16:50:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:59,314 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-20 16:50:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-02-20 16:50:59,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:59,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:59,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:59,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 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 16:50:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-02-20 16:50:59,316 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2022-02-20 16:50:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:59,316 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-02-20 16:50:59,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 16:50:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-02-20 16:50:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:50:59,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:59,317 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] [2022-02-20 16:50:59,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 16:50:59,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:50:59,524 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:50:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2022-02-20 16:50:59,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:59,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123111926] [2022-02-20 16:50:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:59,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1523#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(19, 2); {1523#true} is VALID [2022-02-20 16:50:59,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1525#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1525#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {1525#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~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;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1526#(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| 8))) (= (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 16:50:59,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {1526#(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| 8))) (= (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;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(0 == main_#t~mem11#1.base && 0 == main_#t~mem11#1.offset);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1529#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} is VALID [2022-02-20 16:50:59,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {1524#false} is VALID [2022-02-20 16:50:59,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-02-20 16:50:59,700 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 16:50:59,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:59,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123111926] [2022-02-20 16:50:59,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123111926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:50:59,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824680236] [2022-02-20 16:50:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:50:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:59,704 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 16:50:59,704 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 16:50:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:59,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-20 16:50:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:59,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:50:59,851 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 16:50:59,856 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 16:51:00,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-02-20 16:51:00,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:00,050 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 19 treesize of output 18 [2022-02-20 16:51:00,076 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 0 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 16:51:00,100 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 50 treesize of output 30 [2022-02-20 16:51:00,136 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 18 treesize of output 16 [2022-02-20 16:51:00,166 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:51:00,167 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 16:51:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,362 INFO L356 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2022-02-20 16:51:00,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-02-20 16:51:00,396 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 16:51:00,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:51:00,552 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 16:51:00,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {1523#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(19, 2); {1523#true} is VALID [2022-02-20 16:51:00,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1536#(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| 8))) (= |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 16:51:00,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1536#(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| 8))) (= |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~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1536#(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| 8))) (= |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 16:51:00,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {1536#(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| 8))) (= |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~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~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;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1543#(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| 8))) (= (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|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {1543#(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| 8))) (= (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|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 == main_#t~mem11#1.base && 0 == main_#t~mem11#1.offset);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} goto; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1581#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 16:51:00,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {1581#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1581#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 16:51:00,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1581#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {1581#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 16:51:00,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {1581#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1529#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} is VALID [2022-02-20 16:51:00,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {1524#false} is VALID [2022-02-20 16:51:00,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-02-20 16:51:00,568 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 16:51:00,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:51:00,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:00,660 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 33 treesize of output 34 [2022-02-20 16:51:00,671 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 71 treesize of output 51 [2022-02-20 16:51:00,677 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 24 treesize of output 22 [2022-02-20 16:51:01,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:01,036 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 125 treesize of output 101 [2022-02-20 16:51:01,050 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 198 treesize of output 178 [2022-02-20 16:51:01,064 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 178 treesize of output 170 [2022-02-20 16:51:14,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_596 Int) (v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_arrayElimCell_15 Int)) (let ((.cse4 (= v_arrayElimCell_18 v_arrayElimCell_15)) (.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17))) (or (let ((.cse3 (not .cse0))) (and (let ((.cse1 (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_596))) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and .cse0 (= ~unnamed1~0~BLACK (select (select (store (store (store .cse1 v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (and (= ~unnamed1~0~BLACK (select (select (store (store .cse1 v_arrayElimCell_17 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) .cse3))) (or (not .cse4) .cse3))) (not (= (select |c_#valid| v_arrayElimCell_17) 0)) (not (= (select (store |c_#valid| v_arrayElimCell_17 1) v_arrayElimCell_15) 0)) (and .cse4 .cse0 (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))))) is different from false [2022-02-20 16:51:23,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:23,934 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-20 16:51:23,934 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 109 treesize of output 1 [2022-02-20 16:51:23,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-02-20 16:51:23,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {1524#false} is VALID [2022-02-20 16:51:23,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1529#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} is VALID [2022-02-20 16:51:23,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:23,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:23,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1528#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:23,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(0 == main_#t~mem11#1.base && 0 == main_#t~mem11#1.offset);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} goto; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !!(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:23,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:24,476 WARN L290 TraceCheckUtils]: 4: Hoare triple {1645#(forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_15 Int)) (or (and (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_15))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_15) (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK))) (not (= (select |#valid| v_arrayElimCell_15) 0))))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1527#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is UNKNOWN [2022-02-20 16:51:24,484 WARN L290 TraceCheckUtils]: 3: Hoare triple {1649#(forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_596 Int) (v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_arrayElimCell_15 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_17 1) v_arrayElimCell_15) 0)) (not (= (select |#valid| v_arrayElimCell_17) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)) (and (= ~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_596)) v_arrayElimCell_17 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (or (not (= v_arrayElimCell_18 v_arrayElimCell_15)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (and (= v_arrayElimCell_18 v_arrayElimCell_15) (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17))))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~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;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1645#(forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_arrayElimCell_15 Int)) (or (and (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_15))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_15) (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK))) (not (= (select |#valid| v_arrayElimCell_15) 0))))} is UNKNOWN [2022-02-20 16:51:24,488 WARN L290 TraceCheckUtils]: 2: Hoare triple {1649#(forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_596 Int) (v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_arrayElimCell_15 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_17 1) v_arrayElimCell_15) 0)) (not (= (select |#valid| v_arrayElimCell_17) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)) (and (= ~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_596)) v_arrayElimCell_17 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (or (not (= v_arrayElimCell_18 v_arrayElimCell_15)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (and (= v_arrayElimCell_18 v_arrayElimCell_15) (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1649#(forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_596 Int) (v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_arrayElimCell_15 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_17 1) v_arrayElimCell_15) 0)) (not (= (select |#valid| v_arrayElimCell_17) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)) (and (= ~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_596)) v_arrayElimCell_17 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (or (not (= v_arrayElimCell_18 v_arrayElimCell_15)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (and (= v_arrayElimCell_18 v_arrayElimCell_15) (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17))))} is UNKNOWN [2022-02-20 16:51:24,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1649#(forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_596 Int) (v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_arrayElimCell_15 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_17 1) v_arrayElimCell_15) 0)) (not (= (select |#valid| v_arrayElimCell_17) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)) (and (= ~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_596)) v_arrayElimCell_17 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (or (not (= v_arrayElimCell_18 v_arrayElimCell_15)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17)))) (and (= v_arrayElimCell_18 v_arrayElimCell_15) (forall ((v_ArrVal_607 (Array Int Int)) (v_arrayElimCell_16 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (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_596)) v_arrayElimCell_17 v_ArrVal_594) v_arrayElimCell_18 v_ArrVal_604) v_arrayElimCell_15 v_ArrVal_607) v_arrayElimCell_16 v_ArrVal_603) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17))))} is VALID [2022-02-20 16:51:24,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1523#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(19, 2); {1523#true} is VALID [2022-02-20 16:51:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 16:51:24,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824680236] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:51:24,490 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:51:24,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 16:51:24,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069291156] [2022-02-20 16:51:24,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:51:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 21 [2022-02-20 16:51:24,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:24,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:24,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:24,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:51:24,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:51:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2022-02-20 16:51:24,998 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:25,534 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-02-20 16:51:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:51:25,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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 21 [2022-02-20 16:51:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-02-20 16:51:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-02-20 16:51:25,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-02-20 16:51:25,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:25,602 INFO L225 Difference]: With dead ends: 83 [2022-02-20 16:51:25,602 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 16:51:25,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=176, Unknown=2, NotChecked=28, Total=272 [2022-02-20 16:51:25,603 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:25,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-02-20 16:51:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 16:51:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2022-02-20 16:51:25,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:25,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 64 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,606 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 64 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,606 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 64 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:25,608 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-02-20 16:51:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-02-20 16:51:25,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:25,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:25,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 states. [2022-02-20 16:51:25,608 INFO L87 Difference]: Start difference. First operand has 64 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 states. [2022-02-20 16:51:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:25,610 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-02-20 16:51:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-02-20 16:51:25,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:25,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:25,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:25,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-02-20 16:51:25,612 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 21 [2022-02-20 16:51:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:25,612 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-02-20 16:51:25,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-20 16:51:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:51:25,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:25,613 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] [2022-02-20 16:51:25,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 16:51:25,820 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,SelfDestructingSolverStorable7 [2022-02-20 16:51:25,820 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:51:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2022-02-20 16:51:25,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:25,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534740252] [2022-02-20 16:51:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:25,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {1990#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(19, 2); {1990#true} is VALID [2022-02-20 16:51:25,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1990#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + 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; {1992#(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 16:51:25,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1992#(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~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1992#(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 16:51:25,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {1992#(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~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~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;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1993#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (= (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 16:51:25,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {1993#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (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|) (= (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;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} assume !!(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} goto; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} assume !!(0 == main_#t~mem11#1.base && 0 == main_#t~mem11#1.offset);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} goto; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} goto; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 16:51:25,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {1994#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~list~0#1.offset|)) (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 := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} goto; {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} call main_#t~mem12#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !!(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} goto; {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} assume !(~unnamed1~0~RED == main_#t~mem13#1);havoc main_#t~mem13#1; {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:25,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {1995#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|)) 0))} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {1996#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 16:51:25,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {1996#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem13#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {1996#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} is VALID [2022-02-20 16:51:25,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {1996#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) 0))} assume ~unnamed1~0~RED == main_#t~mem13#1;havoc main_#t~mem13#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {1997#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} is VALID [2022-02-20 16:51:25,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {1997#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {1991#false} is VALID [2022-02-20 16:51:25,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2022-02-20 16:51:25,965 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 16:51:25,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:25,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534740252] [2022-02-20 16:51:25,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534740252] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:51:25,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602185542] [2022-02-20 16:51:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:51:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:51:25,967 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 16:51:25,968 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 16:51:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:26,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 80 conjunts are in the unsatisfiable core [2022-02-20 16:51:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:26,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:26,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:51:26,197 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-02-20 16:51:26,206 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-02-20 16:51:26,227 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-02-20 16:51:26,227 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 2 case distinctions, treesize of input 90 treesize of output 78 [2022-02-20 16:51:26,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:26,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:26,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:26,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:26,235 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 28 treesize of output 25 [2022-02-20 16:51:26,239 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 30 treesize of output 28 [2022-02-20 16:51:26,255 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-02-20 16:51:26,256 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 25 treesize of output 29 [2022-02-20 16:51:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:26,377 INFO L356 Elim1Store]: treesize reduction 59, result has 25.3 percent of original size [2022-02-20 16:51:26,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 104 [2022-02-20 16:51:26,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 52 treesize of output 48 [2022-02-20 16:51:26,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:26,403 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:51:26,425 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 16:51:26,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:51:26,620 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_38| at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) 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 16:51:26,622 INFO L158 Benchmark]: Toolchain (without parser) took 31289.36ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 88.6MB in the beginning and 115.2MB in the end (delta: -26.6MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2022-02-20 16:51:26,622 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:51:26,622 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.90ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 88.0MB in the end (delta: 394.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:51:26,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.76ms. Allocated memory is still 121.6MB. Free memory was 88.0MB in the beginning and 85.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:26,623 INFO L158 Benchmark]: Boogie Preprocessor took 48.11ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:26,623 INFO L158 Benchmark]: RCFGBuilder took 429.81ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 60.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:26,623 INFO L158 Benchmark]: TraceAbstraction took 30421.56ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 59.4MB in the beginning and 115.2MB in the end (delta: -55.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-02-20 16:51:26,624 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.09ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.90ms. Allocated memory is still 121.6MB. Free memory was 88.4MB in the beginning and 88.0MB in the end (delta: 394.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.76ms. Allocated memory is still 121.6MB. Free memory was 88.0MB in the beginning and 85.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.11ms. Allocated memory is still 121.6MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.81ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 60.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30421.56ms. Allocated memory was 121.6MB in the beginning and 211.8MB in the end (delta: 90.2MB). Free memory was 59.4MB in the beginning and 115.2MB in the end (delta: -55.7MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_38| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_38|: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:51:26,651 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:51:28,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:51:28,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:51:28,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:51:28,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:51:28,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:51:28,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:51:28,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:51:28,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:51:28,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:51:28,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:51:28,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:51:28,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:51:28,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:51:28,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:51:28,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:51:28,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:51:28,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:51:28,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:51:28,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:51:28,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:51:28,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:51:28,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:51:28,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:51:28,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:51:28,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:51:28,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:51:28,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:51:28,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:51:28,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:51:28,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:51:28,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:51:28,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:51:28,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:51:28,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:51:28,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:51:28,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:51:28,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:51:28,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:51:28,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:51:28,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:51:28,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:51:28,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:51:28,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:51:28,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:51:28,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:51:28,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:51:28,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:51:28,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:51:28,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:51:28,419 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:51:28,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:51:28,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:51:28,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:51:28,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:51:28,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:51:28,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:51:28,421 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:51:28,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:51:28,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:51:28,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:51:28,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:51:28,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:51:28,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:51:28,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:51:28,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:51:28,423 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:51:28,423 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:51:28,423 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:51:28,424 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:51:28,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:51:28,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:51:28,424 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 ! call(reach_error())) ) 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2022-02-20 16:51:28,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:51:28,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:51:28,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:51:28,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:51:28,718 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:51:28,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-02-20 16:51:28,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846a43062/956a95f5500044c1a7d13cba28372d1a/FLAG26bb69cf2 [2022-02-20 16:51:29,155 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:51:29,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2022-02-20 16:51:29,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846a43062/956a95f5500044c1a7d13cba28372d1a/FLAG26bb69cf2 [2022-02-20 16:51:29,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/846a43062/956a95f5500044c1a7d13cba28372d1a [2022-02-20 16:51:29,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:51:29,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:51:29,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:51:29,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:51:29,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:51:29,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c088c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29, skipping insertion in model container [2022-02-20 16:51:29,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:51:29,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:51:29,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2022-02-20 16:51:29,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2022-02-20 16:51:29,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2022-02-20 16:51:29,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2022-02-20 16:51:29,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2022-02-20 16:51:29,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2022-02-20 16:51:29,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2022-02-20 16:51:29,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:51:29,504 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:51:29,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2022-02-20 16:51:29,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2022-02-20 16:51:29,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2022-02-20 16:51:29,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2022-02-20 16:51:29,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2022-02-20 16:51:29,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2022-02-20 16:51:29,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2022-02-20 16:51:29,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:51:29,571 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:51:29,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29 WrapperNode [2022-02-20 16:51:29,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:51:29,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:51:29,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:51:29,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:51:29,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,634 INFO L137 Inliner]: procedures = 122, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-02-20 16:51:29,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:51:29,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:51:29,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:51:29,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:51:29,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:51:29,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:51:29,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:51:29,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:51:29,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (1/1) ... [2022-02-20 16:51:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:51:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:51:29,719 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 16:51:29,735 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 16:51:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:51:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:51:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:51:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:51:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:51:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:51:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:51:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:51:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:51:29,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:51:29,822 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:51:29,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:51:30,408 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:51:30,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:51:30,413 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 16:51:30,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:30 BoogieIcfgContainer [2022-02-20 16:51:30,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:51:30,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:51:30,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:51:30,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:51:30,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:51:29" (1/3) ... [2022-02-20 16:51:30,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd4b0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:30, skipping insertion in model container [2022-02-20 16:51:30,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:29" (2/3) ... [2022-02-20 16:51:30,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd4b0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:30, skipping insertion in model container [2022-02-20 16:51:30,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:30" (3/3) ... [2022-02-20 16:51:30,419 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2022-02-20 16:51:30,422 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:51:30,423 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 16:51:30,484 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:51:30,488 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:51:30,489 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 16:51:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:51:30,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:30,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:51:30,504 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:51:30,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash 891569350, now seen corresponding path program 1 times [2022-02-20 16:51:30,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:51:30,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671770434] [2022-02-20 16:51:30,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:51:30,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:51:30,521 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 16:51:30,524 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 16:51:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:30,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:51:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:30,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:30,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#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(19bv32, 2bv32); {49#true} is VALID [2022-02-20 16:51:30,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, main_~list~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {49#true} is VALID [2022-02-20 16:51:30,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {49#true} assume !true; {50#false} is VALID [2022-02-20 16:51:30,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {50#false} main_~end~0#1.base, main_~end~0#1.offset := 0bv32, 0bv32;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {50#false} is VALID [2022-02-20 16:51:30,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#false} assume !(0bv32 != main_~end~0#1.base || 0bv32 != main_~end~0#1.offset); {50#false} is VALID [2022-02-20 16:51:30,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {50#false} assume !false; {50#false} is VALID [2022-02-20 16:51:30,659 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 16:51:30,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:51:30,659 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:51:30,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671770434] [2022-02-20 16:51:30,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671770434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:30,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:30,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:51:30,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198530645] [2022-02-20 16:51:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:30,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:30,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:30,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:30,679 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 16:51:30,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:51:30,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:51:30,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:51:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:51:30,696 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:31,230 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2022-02-20 16:51:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:51:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2022-02-20 16:51:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2022-02-20 16:51:31,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 148 transitions. [2022-02-20 16:51:31,379 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 16:51:31,385 INFO L225 Difference]: With dead ends: 90 [2022-02-20 16:51:31,385 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:51:31,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:51:31,389 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:31,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:51:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:51:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:51:31,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:31,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,407 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,407 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:31,409 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 16:51:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 16:51:31,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:31,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:31,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 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 40 states. [2022-02-20 16:51:31,411 INFO L87 Difference]: Start difference. First operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 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 40 states. [2022-02-20 16:51:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:31,412 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-02-20 16:51:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 16:51:31,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:31,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:31,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:31,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-02-20 16:51:31,416 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 6 [2022-02-20 16:51:31,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:31,416 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-02-20 16:51:31,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 16:51:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-02-20 16:51:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:51:31,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:31,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:51:31,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:51:31,639 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 16:51:31,640 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:51:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash 889692517, now seen corresponding path program 1 times [2022-02-20 16:51:31,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:51:31,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371730159] [2022-02-20 16:51:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:31,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:51:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:51:31,656 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 16:51:31,665 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 16:51:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:31,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:51:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:31,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:31,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {289#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(19bv32, 2bv32); {289#true} is VALID [2022-02-20 16:51:31,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, main_~list~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {297#(not (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:51:31,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#(not (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {297#(not (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:51:31,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {297#(not (= |ULTIMATE.start_main_~list~0#1.base| (_ bv0 32)))} main_~end~0#1.base, main_~end~0#1.offset := 0bv32, 0bv32;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {304#(not (= |ULTIMATE.start_main_~end~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:51:31,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {304#(not (= |ULTIMATE.start_main_~end~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_~end~0#1.base || 0bv32 != main_~end~0#1.offset); {290#false} is VALID [2022-02-20 16:51:31,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#false} assume !false; {290#false} is VALID [2022-02-20 16:51:31,790 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 16:51:31,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:51:31,790 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:51:31,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371730159] [2022-02-20 16:51:31,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371730159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:31,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:31,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:51:31,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404893725] [2022-02-20 16:51:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:31,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:31,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:31,819 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 16:51:31,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:51:31,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:51:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:51:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:51:31,820 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,350 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-20 16:51:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:51:32,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-02-20 16:51:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-02-20 16:51:32,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2022-02-20 16:51:32,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,398 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:51:32,398 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:51:32,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:51:32,399 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:32,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:51:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:51:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-02-20 16:51:32,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:32,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,402 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,403 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,404 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:51:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:51:32,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:32,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:32,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:51:32,405 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:51:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:32,406 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 16:51:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-02-20 16:51:32,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:32,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:32,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:32,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-02-20 16:51:32,408 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2022-02-20 16:51:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:32,408 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-02-20 16:51:32,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 16:51:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 16:51:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:51:32,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:32,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:32,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:51:32,617 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 16:51:32,617 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:51:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723981, now seen corresponding path program 1 times [2022-02-20 16:51:32,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:51:32,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536668895] [2022-02-20 16:51:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:32,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:51:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:51:32,620 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 16:51:32,623 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 16:51:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:32,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:51:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:32,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:32,780 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 16:51:32,802 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 16:51:32,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {475#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(19bv32, 2bv32); {475#true} is VALID [2022-02-20 16:51:32,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, main_~list~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {475#true} is VALID [2022-02-20 16:51:32,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem4#1.base, ~bvadd32(4bv32, main_#t~mem4#1.offset), 4bv32);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32);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;call write~$Pointer$(0bv32, 0bv32, main_~end~0#1.base, main_~end~0#1.offset, 4bv32); {475#true} is VALID [2022-02-20 16:51:32,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {475#true} assume !(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~intINTTYPE4(~unnamed1~0~RED, main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12bv32);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4bv32);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, ~bvadd32(4bv32, main_#t~mem8#1.offset), 4bv32);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4bv32);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0bv32, 0bv32, main_~end~0#1.base, main_~end~0#1.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); {489#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:32,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem10#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); {493#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:51:32,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {493#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {476#false} is VALID [2022-02-20 16:51:32,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#false} assume !false; {476#false} is VALID [2022-02-20 16:51:32,815 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 16:51:32,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:51:32,816 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:51:32,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536668895] [2022-02-20 16:51:32,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536668895] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:32,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:32,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:51:32,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897090317] [2022-02-20 16:51:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:51:32,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:32,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:32,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:32,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:51:32,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:51:32,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:51:32,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:51:32,840 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,134 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 16:51:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:51:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:51:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-02-20 16:51:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-02-20 16:51:34,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-02-20 16:51:34,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:34,165 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:51:34,165 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:51:34,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 16:51:34,166 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:34,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:51:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:51:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:51:34,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:34,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,169 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,169 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,170 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:51:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 16:51:34,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:34,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:34,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:51:34,170 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:51:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,171 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:51:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 16:51:34,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:34,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:34,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:34,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-02-20 16:51:34,172 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 7 [2022-02-20 16:51:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:34,172 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-02-20 16:51:34,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 16:51:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:51:34,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:34,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:34,203 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 16:51:34,373 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 16:51:34,374 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:51:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 590587384, now seen corresponding path program 1 times [2022-02-20 16:51:34,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:51:34,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692631756] [2022-02-20 16:51:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:34,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:51:34,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:51:34,377 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 16:51:34,378 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 16:51:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:34,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:51:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:34,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:34,441 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 16:51:34,508 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 16:51:34,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {645#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(19bv32, 2bv32); {645#true} is VALID [2022-02-20 16:51:34,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#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~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet2#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);main_~list~0#1.base, main_~list~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, main_~list~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, main_~list~0#1.base, ~bvadd32(4bv32, main_~list~0#1.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, main_~list~0#1.base, ~bvadd32(8bv32, main_~list~0#1.offset), 4bv32);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {653#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 16:51:34,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {653#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|)))} is VALID [2022-02-20 16:51:34,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {653#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~list~0#1.offset|)))} main_~end~0#1.base, main_~end~0#1.offset := 0bv32, 0bv32;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {660#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:34,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {660#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0bv32 != main_~end~0#1.base || 0bv32 != main_~end~0#1.offset); {660#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:34,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {660#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {660#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:34,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {660#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem12#1 := read~intINTTYPE4(main_~end~0#1.base, ~bvadd32(8bv32, main_~end~0#1.offset), 4bv32); {670#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} is VALID [2022-02-20 16:51:34,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem12#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem12#1);havoc main_#t~mem12#1; {646#false} is VALID [2022-02-20 16:51:34,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-02-20 16:51:34,524 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 16:51:34,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:51:34,524 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:51:34,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692631756] [2022-02-20 16:51:34,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692631756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:34,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:34,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:51:34,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405284803] [2022-02-20 16:51:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:34,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 16:51:34,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:34,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:34,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:51:34,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:51:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:51:34,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:51:34,535 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:36,365 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-02-20 16:51:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:51:36,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 16:51:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-02-20 16:51:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-02-20 16:51:36,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-02-20 16:51:36,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:36,439 INFO L225 Difference]: With dead ends: 58 [2022-02-20 16:51:36,439 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 16:51:36,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 16:51:36,440 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:36,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 85 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:51:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 16:51:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2022-02-20 16:51:36,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:36,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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 16:51:36,443 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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 16:51:36,444 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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 16:51:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:36,445 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-02-20 16:51:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-02-20 16:51:36,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:36,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:36,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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) Second operand 56 states. [2022-02-20 16:51:36,446 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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) Second operand 56 states. [2022-02-20 16:51:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:36,447 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-02-20 16:51:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-02-20 16:51:36,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:36,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:36,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:36,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 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 16:51:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-20 16:51:36,449 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 9 [2022-02-20 16:51:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:36,449 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-20 16:51:36,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 16:51:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:51:36,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:36,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:36,459 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 16:51:36,657 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 16:51:36,657 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 16:51:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1507179337, now seen corresponding path program 1 times [2022-02-20 16:51:36,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:51:36,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837011869] [2022-02-20 16:51:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:36,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:51:36,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:51:36,659 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 16:51:36,662 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 16:51:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:36,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:51:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:36,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:37,531 INFO L356 Elim1Store]: treesize reduction 147, result has 30.3 percent of original size [2022-02-20 16:51:37,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 296 [2022-02-20 16:51:38,530 INFO L356 Elim1Store]: treesize reduction 147, result has 30.3 percent of original size [2022-02-20 16:51:38,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 244 [2022-02-20 16:51:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:38,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-02-20 16:51:38,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:38,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-02-20 16:51:38,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:38,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-02-20 16:51:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:38,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-02-20 16:51:39,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:39,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-02-20 16:51:39,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:39,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-02-20 16:51:39,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:39,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:39,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:39,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:39,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 89 treesize of output 82 [2022-02-20 16:51:39,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:39,841 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:39,926 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 16:51:40,230 INFO L356 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-02-20 16:51:40,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 117 [2022-02-20 16:51:40,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:40,324 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:42,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:42,484 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:47,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:47,522 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:53,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:53,104 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:54,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:54,655 INFO L356 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-02-20 16:51:54,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 252 treesize of output 207 [2022-02-20 16:51:54,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:54,711 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:54,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:54,892 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 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-20 16:51:54,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:54,970 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 0 case distinctions, treesize of input 19 treesize of output 13