./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-01-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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:59:53,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:59:53,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:59:53,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:59:53,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:59:53,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:59:53,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:59:53,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:59:53,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:59:53,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:59:53,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:59:53,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:59:53,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:59:53,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:59:53,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:59:53,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:59:53,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:59:53,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:59:53,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:59:53,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:59:53,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:59:53,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:59:53,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:59:53,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:59:53,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:59:53,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:59:53,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:59:53,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:59:53,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:59:53,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:59:53,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:59:53,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:59:53,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:59:53,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:59:53,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:59:53,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:59:53,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:59:53,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:59:53,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:59:53,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:59:53,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:59:53,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:59:53,673 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:59:53,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:59:53,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:59:53,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:59:53,675 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:59:53,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:59:53,675 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:59:53,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:59:53,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:59:53,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:59:53,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:59:53,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:59:53,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:59:53,677 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:59:53,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:59:53,677 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:59:53,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:59:53,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:59:53,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:59:53,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:59:53,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:59:53,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:59:53,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:59:53,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:59:53,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:59:53,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:59:53,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:59:53,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:59:53,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:59:53,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2020-07-28 17:59:54,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:59:54,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:59:54,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:59:54,030 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:59:54,031 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:59:54,032 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2020-07-28 17:59:54,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd4f4609/ec28998d02ac4342b71efbab43a8dd3a/FLAG07dd3ac35 [2020-07-28 17:59:54,644 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:59:54,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2020-07-28 17:59:54,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd4f4609/ec28998d02ac4342b71efbab43a8dd3a/FLAG07dd3ac35 [2020-07-28 17:59:54,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd4f4609/ec28998d02ac4342b71efbab43a8dd3a [2020-07-28 17:59:54,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:59:54,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:59:54,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:59:54,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:59:54,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:59:54,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:59:54" (1/1) ... [2020-07-28 17:59:54,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170972dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:54, skipping insertion in model container [2020-07-28 17:59:54,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:59:54" (1/1) ... [2020-07-28 17:59:54,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:59:54,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:59:55,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:59:55,433 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:59:55,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:59:55,550 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:59:55,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55 WrapperNode [2020-07-28 17:59:55,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:59:55,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:59:55,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:59:55,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:59:55,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:59:55,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:59:55,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:59:55,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:59:55,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... [2020-07-28 17:59:55,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:59:55,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:59:55,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:59:55,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:59:55,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:59:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 17:59:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 17:59:55,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 17:59:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:59:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:59:55,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:59:56,542 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:59:56,543 INFO L295 CfgBuilder]: Removed 34 assume(true) statements. [2020-07-28 17:59:56,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:59:56 BoogieIcfgContainer [2020-07-28 17:59:56,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:59:56,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:59:56,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:59:56,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:59:56,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:59:54" (1/3) ... [2020-07-28 17:59:56,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4614a5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:59:56, skipping insertion in model container [2020-07-28 17:59:56,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:59:55" (2/3) ... [2020-07-28 17:59:56,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4614a5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:59:56, skipping insertion in model container [2020-07-28 17:59:56,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:59:56" (3/3) ... [2020-07-28 17:59:56,572 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-07-28 17:59:56,591 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:59:56,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-28 17:59:56,644 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-28 17:59:56,670 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:59:56,671 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:59:56,671 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:59:56,671 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:59:56,671 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:59:56,671 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:59:56,672 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:59:56,672 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:59:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-28 17:59:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-28 17:59:56,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:56,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-28 17:59:56,700 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2020-07-28 17:59:56,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:56,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107574255] [2020-07-28 17:59:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:56,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-28 17:59:56,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {88#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 17:59:56,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {88#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume !(main_~list~0.base != 0 || main_~list~0.offset != 0); {87#false} is VALID [2020-07-28 17:59:56,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-28 17:59:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:56,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107574255] [2020-07-28 17:59:56,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:56,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:59:56,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832558015] [2020-07-28 17:59:56,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-28 17:59:56,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:56,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:59:56,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:56,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:59:56,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:59:56,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:59:56,961 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2020-07-28 17:59:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,248 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2020-07-28 17:59:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:59:57,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-28 17:59:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:59:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2020-07-28 17:59:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:59:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2020-07-28 17:59:57,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 296 transitions. [2020-07-28 17:59:57,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:57,715 INFO L225 Difference]: With dead ends: 180 [2020-07-28 17:59:57,715 INFO L226 Difference]: Without dead ends: 95 [2020-07-28 17:59:57,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:59:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-28 17:59:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2020-07-28 17:59:57,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:57,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 77 states. [2020-07-28 17:59:57,770 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 77 states. [2020-07-28 17:59:57,770 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 77 states. [2020-07-28 17:59:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,777 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2020-07-28 17:59:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2020-07-28 17:59:57,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:57,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:57,781 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 95 states. [2020-07-28 17:59:57,781 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 95 states. [2020-07-28 17:59:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:57,788 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2020-07-28 17:59:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2020-07-28 17:59:57,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:57,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:57,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:57,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-28 17:59:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-07-28 17:59:57,798 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2020-07-28 17:59:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:57,799 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-07-28 17:59:57,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:59:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-07-28 17:59:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:59:57,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:57,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:57,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:59:57,802 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2020-07-28 17:59:57,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:57,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558397784] [2020-07-28 17:59:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:57,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {559#true} is VALID [2020-07-28 17:59:57,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {559#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {559#true} is VALID [2020-07-28 17:59:57,883 INFO L280 TraceCheckUtils]: 2: Hoare triple {559#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {559#true} is VALID [2020-07-28 17:59:57,884 INFO L280 TraceCheckUtils]: 3: Hoare triple {559#true} goto; {559#true} is VALID [2020-07-28 17:59:57,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {559#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {559#true} is VALID [2020-07-28 17:59:57,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {559#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {559#true} is VALID [2020-07-28 17:59:57,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {559#true} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {559#true} is VALID [2020-07-28 17:59:57,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {559#true} assume main_#t~short7; {561#|ULTIMATE.start_main_#t~short7|} is VALID [2020-07-28 17:59:57,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {561#|ULTIMATE.start_main_#t~short7|} assume !main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {560#false} is VALID [2020-07-28 17:59:57,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {560#false} assume !false; {560#false} is VALID [2020-07-28 17:59:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:57,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558397784] [2020-07-28 17:59:57,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:57,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:59:57,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454568000] [2020-07-28 17:59:57,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 17:59:57,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:57,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:59:57,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:57,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:59:57,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:57,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:59:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:59:57,916 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 3 states. [2020-07-28 17:59:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,127 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-07-28 17:59:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:59:58,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 17:59:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:59:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2020-07-28 17:59:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:59:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2020-07-28 17:59:58,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2020-07-28 17:59:58,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:58,257 INFO L225 Difference]: With dead ends: 80 [2020-07-28 17:59:58,257 INFO L226 Difference]: Without dead ends: 78 [2020-07-28 17:59:58,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:59:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-28 17:59:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-28 17:59:58,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:58,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-28 17:59:58,280 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-28 17:59:58,281 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-28 17:59:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,285 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2020-07-28 17:59:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2020-07-28 17:59:58,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:58,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:58,287 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-28 17:59:58,287 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-28 17:59:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,291 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2020-07-28 17:59:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2020-07-28 17:59:58,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:58,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:58,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:58,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-28 17:59:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2020-07-28 17:59:58,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2020-07-28 17:59:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:58,298 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2020-07-28 17:59:58,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:59:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2020-07-28 17:59:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:59:58,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:58,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:58,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:59:58,300 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2020-07-28 17:59:58,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:58,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587068793] [2020-07-28 17:59:58,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:58,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {890#true} is VALID [2020-07-28 17:59:58,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {890#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {890#true} is VALID [2020-07-28 17:59:58,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {890#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {890#true} is VALID [2020-07-28 17:59:58,370 INFO L280 TraceCheckUtils]: 3: Hoare triple {890#true} goto; {890#true} is VALID [2020-07-28 17:59:58,370 INFO L280 TraceCheckUtils]: 4: Hoare triple {890#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {890#true} is VALID [2020-07-28 17:59:58,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {890#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {892#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 17:59:58,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {892#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {892#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 17:59:58,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {892#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {893#|ULTIMATE.start_main_#t~short7|} is VALID [2020-07-28 17:59:58,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {893#|ULTIMATE.start_main_#t~short7|} assume !main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {891#false} is VALID [2020-07-28 17:59:58,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {891#false} assume !false; {891#false} is VALID [2020-07-28 17:59:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:58,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587068793] [2020-07-28 17:59:58,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:58,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:59:58,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872485462] [2020-07-28 17:59:58,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 17:59:58,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:58,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:59:58,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:58,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:59:58,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:59:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:59:58,404 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2020-07-28 17:59:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:58,858 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2020-07-28 17:59:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:59:58,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 17:59:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:59:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2020-07-28 17:59:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:59:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2020-07-28 17:59:58,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 148 transitions. [2020-07-28 17:59:59,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:59,093 INFO L225 Difference]: With dead ends: 134 [2020-07-28 17:59:59,094 INFO L226 Difference]: Without dead ends: 132 [2020-07-28 17:59:59,094 INFO L675 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 [2020-07-28 17:59:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-28 17:59:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2020-07-28 17:59:59,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:59,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 80 states. [2020-07-28 17:59:59,123 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 80 states. [2020-07-28 17:59:59,123 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 80 states. [2020-07-28 17:59:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:59,131 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-07-28 17:59:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2020-07-28 17:59:59,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:59,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:59,137 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 132 states. [2020-07-28 17:59:59,138 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 132 states. [2020-07-28 17:59:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:59,147 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-07-28 17:59:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2020-07-28 17:59:59,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:59,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:59,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:59,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-28 17:59:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2020-07-28 17:59:59,160 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 10 [2020-07-28 17:59:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:59,161 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2020-07-28 17:59:59,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:59:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2020-07-28 17:59:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:59:59,165 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:59,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:59,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:59:59,167 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash 263303890, now seen corresponding path program 1 times [2020-07-28 17:59:59,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:59,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701066639] [2020-07-28 17:59:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:59,268 INFO L280 TraceCheckUtils]: 0: Hoare triple {1392#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1392#true} is VALID [2020-07-28 17:59:59,269 INFO L280 TraceCheckUtils]: 1: Hoare triple {1392#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {1392#true} is VALID [2020-07-28 17:59:59,269 INFO L280 TraceCheckUtils]: 2: Hoare triple {1392#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {1392#true} is VALID [2020-07-28 17:59:59,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {1392#true} goto; {1392#true} is VALID [2020-07-28 17:59:59,270 INFO L280 TraceCheckUtils]: 4: Hoare triple {1392#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {1392#true} is VALID [2020-07-28 17:59:59,270 INFO L280 TraceCheckUtils]: 5: Hoare triple {1392#true} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~list~0.base, 8 + main_~list~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem3.base, main_#t~mem3.offset, 4);havoc main_#t~mem3.base, main_#t~mem3.offset;call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4.base, 8 + main_#t~mem4.offset, 4);havoc main_#t~mem4.base, main_#t~mem4.offset; {1392#true} is VALID [2020-07-28 17:59:59,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {1392#true} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {1394#(or |ULTIMATE.start_main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))))} is VALID [2020-07-28 17:59:59,281 INFO L280 TraceCheckUtils]: 7: Hoare triple {1394#(or |ULTIMATE.start_main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))))} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {1395#|ULTIMATE.start_main_#t~short7|} is VALID [2020-07-28 17:59:59,282 INFO L280 TraceCheckUtils]: 8: Hoare triple {1395#|ULTIMATE.start_main_#t~short7|} assume !main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {1393#false} is VALID [2020-07-28 17:59:59,282 INFO L280 TraceCheckUtils]: 9: Hoare triple {1393#false} assume !false; {1393#false} is VALID [2020-07-28 17:59:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:59,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701066639] [2020-07-28 17:59:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:59,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:59:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724935298] [2020-07-28 17:59:59,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 17:59:59,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:59,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:59:59,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:59,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:59:59,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:59:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:59:59,302 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 4 states. [2020-07-28 17:59:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:59,519 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2020-07-28 17:59:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:59:59,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 17:59:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:59:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:59:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2020-07-28 17:59:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:59:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2020-07-28 17:59:59,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2020-07-28 17:59:59,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:59,627 INFO L225 Difference]: With dead ends: 80 [2020-07-28 17:59:59,627 INFO L226 Difference]: Without dead ends: 78 [2020-07-28 17:59:59,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:59:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-28 17:59:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2020-07-28 17:59:59,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:59:59,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 75 states. [2020-07-28 17:59:59,645 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 75 states. [2020-07-28 17:59:59,646 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 75 states. [2020-07-28 17:59:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:59,648 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2020-07-28 17:59:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2020-07-28 17:59:59,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:59,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:59,649 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 78 states. [2020-07-28 17:59:59,649 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 78 states. [2020-07-28 17:59:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:59:59,651 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2020-07-28 17:59:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2020-07-28 17:59:59,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:59:59,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:59:59,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:59:59,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:59:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-28 17:59:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2020-07-28 17:59:59,655 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2020-07-28 17:59:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:59:59,655 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2020-07-28 17:59:59,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:59:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-07-28 17:59:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:59:59,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:59:59,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:59:59,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:59:59,656 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:59:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:59:59,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2020-07-28 17:59:59,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:59:59,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286150035] [2020-07-28 17:59:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:59:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:59:59,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {1721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1721#true} is VALID [2020-07-28 17:59:59,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {1721#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {1721#true} is VALID [2020-07-28 17:59:59,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {1721#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {1721#true} is VALID [2020-07-28 17:59:59,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {1721#true} goto; {1721#true} is VALID [2020-07-28 17:59:59,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {1721#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {1721#true} is VALID [2020-07-28 17:59:59,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {1721#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {1723#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 17:59:59,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {1723#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {1724#(not |ULTIMATE.start_main_#t~short7|)} is VALID [2020-07-28 17:59:59,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {1724#(not |ULTIMATE.start_main_#t~short7|)} assume main_#t~short7; {1722#false} is VALID [2020-07-28 17:59:59,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {1722#false} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {1722#false} is VALID [2020-07-28 17:59:59,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {1722#false} goto; {1722#false} is VALID [2020-07-28 17:59:59,750 INFO L280 TraceCheckUtils]: 10: Hoare triple {1722#false} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {1722#false} is VALID [2020-07-28 17:59:59,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {1722#false} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {1722#false} is VALID [2020-07-28 17:59:59,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {1722#false} assume !!(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc9.base, main_#t~malloc9.offset, main_~end~0.base, main_~end~0.offset, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);call write~$Pointer$(main_~end~0.base, main_~end~0.offset, main_#t~mem10.base, 4 + main_#t~mem10.offset, 4);havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;call write~$Pointer$(0, 0, main_~end~0.base, main_~end~0.offset, 4); {1722#false} is VALID [2020-07-28 17:59:59,750 INFO L280 TraceCheckUtils]: 13: Hoare triple {1722#false} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {1722#false} is VALID [2020-07-28 17:59:59,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2020-07-28 17:59:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:59:59,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286150035] [2020-07-28 17:59:59,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:59:59,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:59:59,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252732065] [2020-07-28 17:59:59,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 17:59:59,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:59:59,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:59:59,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:59:59,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:59:59,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:59:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:59:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:59:59,777 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 4 states. [2020-07-28 18:00:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:00,156 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2020-07-28 18:00:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:00:00,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 18:00:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2020-07-28 18:00:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2020-07-28 18:00:00,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2020-07-28 18:00:00,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:00,425 INFO L225 Difference]: With dead ends: 195 [2020-07-28 18:00:00,426 INFO L226 Difference]: Without dead ends: 128 [2020-07-28 18:00:00,427 INFO L675 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 [2020-07-28 18:00:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-28 18:00:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2020-07-28 18:00:00,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:00,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 77 states. [2020-07-28 18:00:00,454 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 77 states. [2020-07-28 18:00:00,454 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 77 states. [2020-07-28 18:00:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:00,459 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2020-07-28 18:00:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2020-07-28 18:00:00,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:00,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:00,460 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 128 states. [2020-07-28 18:00:00,461 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 128 states. [2020-07-28 18:00:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:00,465 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2020-07-28 18:00:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2020-07-28 18:00:00,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:00,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:00,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:00,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-28 18:00:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-07-28 18:00:00,469 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2020-07-28 18:00:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:00,469 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-07-28 18:00:00,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:00:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-07-28 18:00:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 18:00:00,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:00,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:00,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 18:00:00,471 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2020-07-28 18:00:00,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:00,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903822838] [2020-07-28 18:00:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:00,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {2278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2278#true} is VALID [2020-07-28 18:00:00,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {2278#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,564 INFO L280 TraceCheckUtils]: 3: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} goto; {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} goto; {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:00,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {2280#(= 1 (select |#valid| ULTIMATE.start_main_~list~0.base))} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {2281#(= 1 (select |#valid| ULTIMATE.start_main_~end~0.base))} is VALID [2020-07-28 18:00:00,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {2281#(= 1 (select |#valid| ULTIMATE.start_main_~end~0.base))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {2281#(= 1 (select |#valid| ULTIMATE.start_main_~end~0.base))} is VALID [2020-07-28 18:00:00,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {2281#(= 1 (select |#valid| ULTIMATE.start_main_~end~0.base))} assume !!(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc9.base, main_#t~malloc9.offset, main_~end~0.base, main_~end~0.offset, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);call write~$Pointer$(main_~end~0.base, main_~end~0.offset, main_#t~mem10.base, 4 + main_#t~mem10.offset, 4);havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;call write~$Pointer$(0, 0, main_~end~0.base, main_~end~0.offset, 4); {2282#(not (= ULTIMATE.start_main_~end~0.base 0))} is VALID [2020-07-28 18:00:00,572 INFO L280 TraceCheckUtils]: 13: Hoare triple {2282#(not (= ULTIMATE.start_main_~end~0.base 0))} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {2279#false} is VALID [2020-07-28 18:00:00,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {2279#false} assume !false; {2279#false} is VALID [2020-07-28 18:00:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:00,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903822838] [2020-07-28 18:00:00,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:00,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:00:00,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754157774] [2020-07-28 18:00:00,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 18:00:00,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:00,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:00:00,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:00,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:00:00,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:00,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:00:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:00:00,595 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2020-07-28 18:00:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:00,992 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-07-28 18:00:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:00:00,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 18:00:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2020-07-28 18:00:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2020-07-28 18:00:00,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 134 transitions. [2020-07-28 18:00:01,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:01,135 INFO L225 Difference]: With dead ends: 122 [2020-07-28 18:00:01,135 INFO L226 Difference]: Without dead ends: 118 [2020-07-28 18:00:01,136 INFO L675 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 [2020-07-28 18:00:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-28 18:00:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2020-07-28 18:00:01,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:01,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 73 states. [2020-07-28 18:00:01,159 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 73 states. [2020-07-28 18:00:01,159 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 73 states. [2020-07-28 18:00:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:01,162 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2020-07-28 18:00:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2020-07-28 18:00:01,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:01,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:01,163 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 118 states. [2020-07-28 18:00:01,163 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 118 states. [2020-07-28 18:00:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:01,167 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2020-07-28 18:00:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2020-07-28 18:00:01,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:01,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:01,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:01,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-28 18:00:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2020-07-28 18:00:01,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2020-07-28 18:00:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:01,170 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2020-07-28 18:00:01,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:00:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2020-07-28 18:00:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 18:00:01,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:01,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:01,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 18:00:01,171 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2020-07-28 18:00:01,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:01,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062698855] [2020-07-28 18:00:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:01,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {2735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2735#true} is VALID [2020-07-28 18:00:01,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {2735#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {2737#(= 0 ULTIMATE.start_main_~list~0.offset)} is VALID [2020-07-28 18:00:01,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {2737#(= 0 ULTIMATE.start_main_~list~0.offset)} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} goto; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} goto; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,234 INFO L280 TraceCheckUtils]: 10: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,235 INFO L280 TraceCheckUtils]: 12: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} is VALID [2020-07-28 18:00:01,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {2738#(not (= 0 ULTIMATE.start_main_~list~0.base))} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {2739#(not (= ULTIMATE.start_main_~end~0.base 0))} is VALID [2020-07-28 18:00:01,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {2739#(not (= ULTIMATE.start_main_~end~0.base 0))} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {2736#false} is VALID [2020-07-28 18:00:01,237 INFO L280 TraceCheckUtils]: 15: Hoare triple {2736#false} assume !false; {2736#false} is VALID [2020-07-28 18:00:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:01,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062698855] [2020-07-28 18:00:01,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:01,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:00:01,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41858259] [2020-07-28 18:00:01,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-28 18:00:01,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:01,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:00:01,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:01,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:00:01,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:00:01,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:00:01,256 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 5 states. [2020-07-28 18:00:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:01,622 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2020-07-28 18:00:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:00:01,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-28 18:00:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2020-07-28 18:00:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:00:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2020-07-28 18:00:01,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2020-07-28 18:00:01,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:01,811 INFO L225 Difference]: With dead ends: 132 [2020-07-28 18:00:01,811 INFO L226 Difference]: Without dead ends: 112 [2020-07-28 18:00:01,812 INFO L675 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 [2020-07-28 18:00:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-28 18:00:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2020-07-28 18:00:01,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:01,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 72 states. [2020-07-28 18:00:01,844 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 72 states. [2020-07-28 18:00:01,844 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 72 states. [2020-07-28 18:00:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:01,848 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-07-28 18:00:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2020-07-28 18:00:01,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:01,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:01,849 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 112 states. [2020-07-28 18:00:01,849 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 112 states. [2020-07-28 18:00:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:01,852 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-07-28 18:00:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2020-07-28 18:00:01,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:01,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:01,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:01,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-28 18:00:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2020-07-28 18:00:01,855 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2020-07-28 18:00:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:01,856 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2020-07-28 18:00:01,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:00:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2020-07-28 18:00:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 18:00:01,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:01,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:01,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 18:00:01,857 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2020-07-28 18:00:01,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:01,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293704408] [2020-07-28 18:00:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:01,895 INFO L280 TraceCheckUtils]: 0: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3189#true} is VALID [2020-07-28 18:00:01,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {3189#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {3189#true} is VALID [2020-07-28 18:00:01,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {3189#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {3189#true} is VALID [2020-07-28 18:00:01,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {3189#true} goto; {3189#true} is VALID [2020-07-28 18:00:01,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {3189#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {3189#true} is VALID [2020-07-28 18:00:01,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {3189#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {3189#true} is VALID [2020-07-28 18:00:01,897 INFO L280 TraceCheckUtils]: 6: Hoare triple {3189#true} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {3189#true} is VALID [2020-07-28 18:00:01,897 INFO L280 TraceCheckUtils]: 7: Hoare triple {3189#true} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {3189#true} is VALID [2020-07-28 18:00:01,897 INFO L280 TraceCheckUtils]: 8: Hoare triple {3189#true} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {3189#true} is VALID [2020-07-28 18:00:01,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {3189#true} goto; {3189#true} is VALID [2020-07-28 18:00:01,898 INFO L280 TraceCheckUtils]: 10: Hoare triple {3189#true} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {3189#true} is VALID [2020-07-28 18:00:01,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {3189#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {3189#true} is VALID [2020-07-28 18:00:01,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {3189#true} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {3189#true} is VALID [2020-07-28 18:00:01,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {3189#true} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {3189#true} is VALID [2020-07-28 18:00:01,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {3189#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {3189#true} is VALID [2020-07-28 18:00:01,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {3189#true} goto; {3189#true} is VALID [2020-07-28 18:00:01,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {3189#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);main_~len~0 := 0;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_~inner~0.base, main_~inner~0.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset; {3191#(= 0 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:00:01,901 INFO L280 TraceCheckUtils]: 17: Hoare triple {3191#(= 0 ULTIMATE.start_main_~len~0)} assume !(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {3191#(= 0 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:00:01,902 INFO L280 TraceCheckUtils]: 18: Hoare triple {3191#(= 0 ULTIMATE.start_main_~len~0)} assume !(main_~len~0 <= 1); {3190#false} is VALID [2020-07-28 18:00:01,902 INFO L280 TraceCheckUtils]: 19: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2020-07-28 18:00:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:01,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293704408] [2020-07-28 18:00:01,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:01,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:00:01,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283036975] [2020-07-28 18:00:01,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 18:00:01,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:01,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:00:01,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:01,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:00:01,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:00:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:00:01,925 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2020-07-28 18:00:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:02,081 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2020-07-28 18:00:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:00:02,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 18:00:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:00:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-28 18:00:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:00:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-28 18:00:02,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2020-07-28 18:00:02,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:02,254 INFO L225 Difference]: With dead ends: 137 [2020-07-28 18:00:02,254 INFO L226 Difference]: Without dead ends: 96 [2020-07-28 18:00:02,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:00:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-28 18:00:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2020-07-28 18:00:02,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:02,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 75 states. [2020-07-28 18:00:02,294 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 75 states. [2020-07-28 18:00:02,294 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 75 states. [2020-07-28 18:00:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:02,301 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2020-07-28 18:00:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2020-07-28 18:00:02,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:02,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:02,302 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 96 states. [2020-07-28 18:00:02,302 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 96 states. [2020-07-28 18:00:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:02,305 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2020-07-28 18:00:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2020-07-28 18:00:02,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:02,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:02,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:02,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-28 18:00:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-07-28 18:00:02,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2020-07-28 18:00:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:02,311 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-07-28 18:00:02,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:00:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-07-28 18:00:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 18:00:02,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:02,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:02,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-28 18:00:02,313 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2020-07-28 18:00:02,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:02,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893169407] [2020-07-28 18:00:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:02,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {3615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3615#true} is VALID [2020-07-28 18:00:02,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {3615#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {3615#true} is VALID [2020-07-28 18:00:02,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {3615#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {3615#true} is VALID [2020-07-28 18:00:02,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {3615#true} goto; {3615#true} is VALID [2020-07-28 18:00:02,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {3615#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {3615#true} is VALID [2020-07-28 18:00:02,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {3615#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {3615#true} is VALID [2020-07-28 18:00:02,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {3615#true} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {3615#true} is VALID [2020-07-28 18:00:02,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {3615#true} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {3615#true} is VALID [2020-07-28 18:00:02,410 INFO L280 TraceCheckUtils]: 8: Hoare triple {3615#true} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {3615#true} is VALID [2020-07-28 18:00:02,410 INFO L280 TraceCheckUtils]: 9: Hoare triple {3615#true} goto; {3615#true} is VALID [2020-07-28 18:00:02,410 INFO L280 TraceCheckUtils]: 10: Hoare triple {3615#true} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {3615#true} is VALID [2020-07-28 18:00:02,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {3615#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {3615#true} is VALID [2020-07-28 18:00:02,411 INFO L280 TraceCheckUtils]: 12: Hoare triple {3615#true} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {3615#true} is VALID [2020-07-28 18:00:02,411 INFO L280 TraceCheckUtils]: 13: Hoare triple {3615#true} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {3615#true} is VALID [2020-07-28 18:00:02,411 INFO L280 TraceCheckUtils]: 14: Hoare triple {3615#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {3615#true} is VALID [2020-07-28 18:00:02,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {3615#true} goto; {3615#true} is VALID [2020-07-28 18:00:02,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {3615#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);main_~len~0 := 0;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_~inner~0.base, main_~inner~0.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset; {3615#true} is VALID [2020-07-28 18:00:02,413 INFO L280 TraceCheckUtils]: 17: Hoare triple {3615#true} assume !!(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {3617#(or (not (= 0 ULTIMATE.start_main_~inner~0.offset)) (not (= 0 ULTIMATE.start_main_~inner~0.base)))} is VALID [2020-07-28 18:00:02,413 INFO L280 TraceCheckUtils]: 18: Hoare triple {3617#(or (not (= 0 ULTIMATE.start_main_~inner~0.offset)) (not (= 0 ULTIMATE.start_main_~inner~0.base)))} assume 0 == main_~len~0;main_~len~0 := 1; {3617#(or (not (= 0 ULTIMATE.start_main_~inner~0.offset)) (not (= 0 ULTIMATE.start_main_~inner~0.base)))} is VALID [2020-07-28 18:00:02,414 INFO L280 TraceCheckUtils]: 19: Hoare triple {3617#(or (not (= 0 ULTIMATE.start_main_~inner~0.offset)) (not (= 0 ULTIMATE.start_main_~inner~0.base)))} assume !(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {3616#false} is VALID [2020-07-28 18:00:02,414 INFO L280 TraceCheckUtils]: 20: Hoare triple {3616#false} assume !false; {3616#false} is VALID [2020-07-28 18:00:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:02,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893169407] [2020-07-28 18:00:02,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:02,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:00:02,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588993720] [2020-07-28 18:00:02,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-28 18:00:02,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:02,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:00:02,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:02,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:00:02,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:02,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:00:02,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:00:02,464 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2020-07-28 18:00:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:02,592 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2020-07-28 18:00:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:00:02,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-28 18:00:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:00:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-28 18:00:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:00:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-28 18:00:02,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2020-07-28 18:00:02,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:02,721 INFO L225 Difference]: With dead ends: 75 [2020-07-28 18:00:02,722 INFO L226 Difference]: Without dead ends: 73 [2020-07-28 18:00:02,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:00:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-28 18:00:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-07-28 18:00:02,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:02,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2020-07-28 18:00:02,764 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2020-07-28 18:00:02,764 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2020-07-28 18:00:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:02,767 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-28 18:00:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-28 18:00:02,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:02,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:02,767 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2020-07-28 18:00:02,767 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2020-07-28 18:00:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:02,769 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-28 18:00:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-28 18:00:02,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:02,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:02,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:02,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-28 18:00:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2020-07-28 18:00:02,771 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2020-07-28 18:00:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:02,772 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2020-07-28 18:00:02,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:00:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-28 18:00:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 18:00:02,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:02,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:02,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-28 18:00:02,773 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2020-07-28 18:00:02,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:02,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992471200] [2020-07-28 18:00:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:02,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {3928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3928#true} is VALID [2020-07-28 18:00:02,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {3928#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {3928#true} is VALID [2020-07-28 18:00:02,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {3928#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {3928#true} is VALID [2020-07-28 18:00:02,832 INFO L280 TraceCheckUtils]: 3: Hoare triple {3928#true} goto; {3928#true} is VALID [2020-07-28 18:00:02,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {3928#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {3928#true} is VALID [2020-07-28 18:00:02,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {3928#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {3928#true} is VALID [2020-07-28 18:00:02,833 INFO L280 TraceCheckUtils]: 6: Hoare triple {3928#true} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {3928#true} is VALID [2020-07-28 18:00:02,833 INFO L280 TraceCheckUtils]: 7: Hoare triple {3928#true} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {3928#true} is VALID [2020-07-28 18:00:02,833 INFO L280 TraceCheckUtils]: 8: Hoare triple {3928#true} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {3928#true} is VALID [2020-07-28 18:00:02,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {3928#true} goto; {3928#true} is VALID [2020-07-28 18:00:02,834 INFO L280 TraceCheckUtils]: 10: Hoare triple {3928#true} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {3928#true} is VALID [2020-07-28 18:00:02,834 INFO L280 TraceCheckUtils]: 11: Hoare triple {3928#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {3928#true} is VALID [2020-07-28 18:00:02,834 INFO L280 TraceCheckUtils]: 12: Hoare triple {3928#true} assume !!(0 != main_#t~nondet8);havoc main_#t~nondet8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc9.base, main_#t~malloc9.offset, main_~end~0.base, main_~end~0.offset, 4);call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);call write~$Pointer$(main_~end~0.base, main_~end~0.offset, main_#t~mem10.base, 4 + main_#t~mem10.offset, 4);havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem11.base, main_#t~mem11.offset;havoc main_#t~mem11.base, main_#t~mem11.offset;call write~$Pointer$(0, 0, main_~end~0.base, main_~end~0.offset, 4); {3928#true} is VALID [2020-07-28 18:00:02,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {3928#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {3928#true} is VALID [2020-07-28 18:00:02,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {3928#true} goto; {3928#true} is VALID [2020-07-28 18:00:02,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {3928#true} assume !!(main_~end~0.base != 0 || main_~end~0.offset != 0); {3928#true} is VALID [2020-07-28 18:00:02,835 INFO L280 TraceCheckUtils]: 16: Hoare triple {3928#true} goto; {3928#true} is VALID [2020-07-28 18:00:02,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {3928#true} assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; {3928#true} is VALID [2020-07-28 18:00:02,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {3928#true} assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call write~$Pointer$(0, 0, main_~end~0.base, 8 + main_~end~0.offset, 4); {3928#true} is VALID [2020-07-28 18:00:02,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {3928#true} call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_#t~short18 := main_#t~mem16.base != 0 || main_#t~mem16.offset != 0; {3930#(or |ULTIMATE.start_main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8)))))} is VALID [2020-07-28 18:00:02,839 INFO L280 TraceCheckUtils]: 20: Hoare triple {3930#(or |ULTIMATE.start_main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8)))))} assume !main_#t~short18;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_#t~short18 := main_#t~mem17.base == 0 && main_#t~mem17.offset == 0; {3931#|ULTIMATE.start_main_#t~short18|} is VALID [2020-07-28 18:00:02,839 INFO L280 TraceCheckUtils]: 21: Hoare triple {3931#|ULTIMATE.start_main_#t~short18|} assume !main_#t~short18;havoc main_#t~mem17.base, main_#t~mem17.offset;havoc main_#t~short18;havoc main_#t~mem16.base, main_#t~mem16.offset; {3929#false} is VALID [2020-07-28 18:00:02,840 INFO L280 TraceCheckUtils]: 22: Hoare triple {3929#false} assume !false; {3929#false} is VALID [2020-07-28 18:00:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:02,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992471200] [2020-07-28 18:00:02,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:02,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:00:02,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330773875] [2020-07-28 18:00:02,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-28 18:00:02,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:02,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:00:02,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:02,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:00:02,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:02,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:00:02,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:00:02,868 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2020-07-28 18:00:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:03,085 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-07-28 18:00:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:00:03,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-28 18:00:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-28 18:00:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-28 18:00:03,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-28 18:00:03,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:03,176 INFO L225 Difference]: With dead ends: 74 [2020-07-28 18:00:03,176 INFO L226 Difference]: Without dead ends: 72 [2020-07-28 18:00:03,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:00:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-28 18:00:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-07-28 18:00:03,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:03,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2020-07-28 18:00:03,201 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2020-07-28 18:00:03,201 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2020-07-28 18:00:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:03,202 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2020-07-28 18:00:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2020-07-28 18:00:03,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:03,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:03,203 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2020-07-28 18:00:03,203 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2020-07-28 18:00:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:03,204 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2020-07-28 18:00:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2020-07-28 18:00:03,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:03,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:03,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:03,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-28 18:00:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2020-07-28 18:00:03,207 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2020-07-28 18:00:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:03,207 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2020-07-28 18:00:03,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:00:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2020-07-28 18:00:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-28 18:00:03,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:03,208 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:03,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-28 18:00:03,208 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:03,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2020-07-28 18:00:03,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:03,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010559698] [2020-07-28 18:00:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:03,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {4237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4237#true} is VALID [2020-07-28 18:00:03,349 INFO L280 TraceCheckUtils]: 1: Hoare triple {4237#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} is VALID [2020-07-28 18:00:03,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} is VALID [2020-07-28 18:00:03,350 INFO L280 TraceCheckUtils]: 3: Hoare triple {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} goto; {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} is VALID [2020-07-28 18:00:03,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} is VALID [2020-07-28 18:00:03,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {4239#(= 0 ULTIMATE.start_main_~list~0.offset)} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} goto; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:03,364 INFO L280 TraceCheckUtils]: 13: Hoare triple {4240#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {4241#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} is VALID [2020-07-28 18:00:03,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {4241#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {4241#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} is VALID [2020-07-28 18:00:03,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {4241#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} goto; {4241#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} is VALID [2020-07-28 18:00:03,367 INFO L280 TraceCheckUtils]: 16: Hoare triple {4241#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);main_~len~0 := 0;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_~inner~0.base, main_~inner~0.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset; {4242#(and (= 0 ULTIMATE.start_main_~inner~0.offset) (= 0 ULTIMATE.start_main_~inner~0.base))} is VALID [2020-07-28 18:00:03,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {4242#(and (= 0 ULTIMATE.start_main_~inner~0.offset) (= 0 ULTIMATE.start_main_~inner~0.base))} assume !!(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {4238#false} is VALID [2020-07-28 18:00:03,368 INFO L280 TraceCheckUtils]: 18: Hoare triple {4238#false} assume 0 == main_~len~0;main_~len~0 := 1; {4238#false} is VALID [2020-07-28 18:00:03,368 INFO L280 TraceCheckUtils]: 19: Hoare triple {4238#false} assume !!(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {4238#false} is VALID [2020-07-28 18:00:03,368 INFO L280 TraceCheckUtils]: 20: Hoare triple {4238#false} goto; {4238#false} is VALID [2020-07-28 18:00:03,369 INFO L280 TraceCheckUtils]: 21: Hoare triple {4238#false} call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~inner~0.base, 8 + main_~inner~0.offset, 4); {4238#false} is VALID [2020-07-28 18:00:03,369 INFO L280 TraceCheckUtils]: 22: Hoare triple {4238#false} assume !(0 == main_#t~mem20.base && 0 == main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset; {4238#false} is VALID [2020-07-28 18:00:03,369 INFO L280 TraceCheckUtils]: 23: Hoare triple {4238#false} assume !false; {4238#false} is VALID [2020-07-28 18:00:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:03,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010559698] [2020-07-28 18:00:03,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:03,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-28 18:00:03,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935582726] [2020-07-28 18:00:03,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-28 18:00:03,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:03,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:00:03,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:03,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:00:03,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:00:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:00:03,413 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 6 states. [2020-07-28 18:00:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:04,247 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-28 18:00:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 18:00:04,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-28 18:00:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:00:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2020-07-28 18:00:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:00:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2020-07-28 18:00:04,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 213 transitions. [2020-07-28 18:00:04,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:04,558 INFO L225 Difference]: With dead ends: 199 [2020-07-28 18:00:04,558 INFO L226 Difference]: Without dead ends: 157 [2020-07-28 18:00:04,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:00:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-28 18:00:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 93. [2020-07-28 18:00:04,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:04,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 93 states. [2020-07-28 18:00:04,620 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 93 states. [2020-07-28 18:00:04,621 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 93 states. [2020-07-28 18:00:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:04,625 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2020-07-28 18:00:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2020-07-28 18:00:04,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:04,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:04,626 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 157 states. [2020-07-28 18:00:04,626 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 157 states. [2020-07-28 18:00:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:04,630 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2020-07-28 18:00:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2020-07-28 18:00:04,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:04,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:04,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:04,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-28 18:00:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2020-07-28 18:00:04,635 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 24 [2020-07-28 18:00:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:04,635 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2020-07-28 18:00:04,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:00:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2020-07-28 18:00:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-28 18:00:04,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:04,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:04,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-28 18:00:04,637 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:04,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2020-07-28 18:00:04,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:04,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014342849] [2020-07-28 18:00:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:04,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {4890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4890#true} is VALID [2020-07-28 18:00:04,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {4890#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} is VALID [2020-07-28 18:00:04,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} is VALID [2020-07-28 18:00:04,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} goto; {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} is VALID [2020-07-28 18:00:04,993 INFO L280 TraceCheckUtils]: 4: Hoare triple {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} is VALID [2020-07-28 18:00:04,996 INFO L280 TraceCheckUtils]: 5: Hoare triple {4892#(and (= 0 ULTIMATE.start_main_~list~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~list~0.base)))} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~list~0.base, 8 + main_~list~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem3.base, main_#t~mem3.offset, 4);havoc main_#t~mem3.base, main_#t~mem3.offset;call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4.base, 8 + main_#t~mem4.offset, 4);havoc main_#t~mem4.base, main_#t~mem4.offset; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:04,997 INFO L280 TraceCheckUtils]: 6: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:04,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume main_#t~short7; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:04,998 INFO L280 TraceCheckUtils]: 8: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:04,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} goto; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:05,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:05,001 INFO L280 TraceCheckUtils]: 11: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:05,001 INFO L280 TraceCheckUtils]: 12: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:05,002 INFO L280 TraceCheckUtils]: 13: Hoare triple {4893#(and (= 0 ULTIMATE.start_main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {4894#(and (or (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} is VALID [2020-07-28 18:00:05,003 INFO L280 TraceCheckUtils]: 14: Hoare triple {4894#(and (or (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {4894#(and (or (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} is VALID [2020-07-28 18:00:05,005 INFO L280 TraceCheckUtils]: 15: Hoare triple {4894#(and (or (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} goto; {4894#(and (or (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} is VALID [2020-07-28 18:00:05,006 INFO L280 TraceCheckUtils]: 16: Hoare triple {4894#(and (or (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~end~0.base) (+ ULTIMATE.start_main_~end~0.offset 8))))} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);main_~len~0 := 0;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_~inner~0.base, main_~inner~0.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset; {4895#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8)))) (= 0 ULTIMATE.start_main_~inner~0.base)) (= 0 ULTIMATE.start_main_~inner~0.offset))} is VALID [2020-07-28 18:00:05,007 INFO L280 TraceCheckUtils]: 17: Hoare triple {4895#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8)))) (= 0 ULTIMATE.start_main_~inner~0.base)) (= 0 ULTIMATE.start_main_~inner~0.offset))} assume !!(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} is VALID [2020-07-28 18:00:05,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} assume 0 == main_~len~0;main_~len~0 := 1; {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} is VALID [2020-07-28 18:00:05,010 INFO L280 TraceCheckUtils]: 19: Hoare triple {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} assume !!(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} is VALID [2020-07-28 18:00:05,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} goto; {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} is VALID [2020-07-28 18:00:05,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {4896#(and (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~inner~0.base) (+ ULTIMATE.start_main_~inner~0.offset 8))) (= 0 ULTIMATE.start_main_~inner~0.offset))} call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~inner~0.base, 8 + main_~inner~0.offset, 4); {4897#(and (= |ULTIMATE.start_main_#t~mem20.base| 0) (= 0 |ULTIMATE.start_main_#t~mem20.offset|))} is VALID [2020-07-28 18:00:05,013 INFO L280 TraceCheckUtils]: 22: Hoare triple {4897#(and (= |ULTIMATE.start_main_#t~mem20.base| 0) (= 0 |ULTIMATE.start_main_#t~mem20.offset|))} assume !(0 == main_#t~mem20.base && 0 == main_#t~mem20.offset);havoc main_#t~mem20.base, main_#t~mem20.offset; {4891#false} is VALID [2020-07-28 18:00:05,014 INFO L280 TraceCheckUtils]: 23: Hoare triple {4891#false} assume !false; {4891#false} is VALID [2020-07-28 18:00:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:00:05,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014342849] [2020-07-28 18:00:05,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:05,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-28 18:00:05,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988119093] [2020-07-28 18:00:05,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-28 18:00:05,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:05,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:00:05,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:05,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:00:05,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:00:05,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:00:05,068 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 8 states. [2020-07-28 18:00:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:06,910 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2020-07-28 18:00:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 18:00:06,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-28 18:00:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:00:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2020-07-28 18:00:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:00:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2020-07-28 18:00:06,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 167 transitions. [2020-07-28 18:00:07,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:07,248 INFO L225 Difference]: With dead ends: 188 [2020-07-28 18:00:07,248 INFO L226 Difference]: Without dead ends: 186 [2020-07-28 18:00:07,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-07-28 18:00:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-28 18:00:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2020-07-28 18:00:07,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:07,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 112 states. [2020-07-28 18:00:07,359 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 112 states. [2020-07-28 18:00:07,359 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 112 states. [2020-07-28 18:00:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:07,365 INFO L93 Difference]: Finished difference Result 186 states and 210 transitions. [2020-07-28 18:00:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2020-07-28 18:00:07,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:07,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:07,367 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 186 states. [2020-07-28 18:00:07,367 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 186 states. [2020-07-28 18:00:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:07,375 INFO L93 Difference]: Finished difference Result 186 states and 210 transitions. [2020-07-28 18:00:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2020-07-28 18:00:07,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:07,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:07,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:07,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-28 18:00:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2020-07-28 18:00:07,379 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 24 [2020-07-28 18:00:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:07,379 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2020-07-28 18:00:07,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:00:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2020-07-28 18:00:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:00:07,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:07,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:07,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-28 18:00:07,382 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2020-07-28 18:00:07,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:07,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504786579] [2020-07-28 18:00:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:07,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {5628#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5628#true} is VALID [2020-07-28 18:00:07,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {5628#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {5628#true} is VALID [2020-07-28 18:00:07,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {5628#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {5628#true} is VALID [2020-07-28 18:00:07,473 INFO L280 TraceCheckUtils]: 3: Hoare triple {5628#true} goto; {5628#true} is VALID [2020-07-28 18:00:07,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {5628#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {5628#true} is VALID [2020-07-28 18:00:07,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {5628#true} assume 0 != main_#t~nondet1;havoc main_#t~nondet1;call write~$Pointer$(0, 0, main_~list~0.base, 8 + main_~list~0.offset, 4); {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,477 INFO L280 TraceCheckUtils]: 6: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !main_#t~short7;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem6.base == 0 && main_#t~mem6.offset == 0; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,481 INFO L280 TraceCheckUtils]: 9: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} goto; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} goto; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);main_~len~0 := 0;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_~inner~0.base, main_~inner~0.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,497 INFO L280 TraceCheckUtils]: 17: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,498 INFO L280 TraceCheckUtils]: 18: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!(main_~len~0 <= 1); {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} goto; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem23.base, main_#t~mem23.offset;havoc main_#t~mem23.base, main_#t~mem23.offset; {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,502 INFO L280 TraceCheckUtils]: 21: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} is VALID [2020-07-28 18:00:07,504 INFO L280 TraceCheckUtils]: 22: Hoare triple {5630#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) (+ ULTIMATE.start_main_~list~0.offset 8))))} assume !!(0 != main_~list~0.base || 0 != main_~list~0.offset);call main_#t~mem24.base, main_#t~mem24.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem24.base, main_#t~mem24.offset;havoc main_#t~mem24.base, main_#t~mem24.offset; {5631#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= ULTIMATE.start_main_~end~0.base 0))} is VALID [2020-07-28 18:00:07,505 INFO L280 TraceCheckUtils]: 23: Hoare triple {5631#(and (= 0 ULTIMATE.start_main_~end~0.offset) (= ULTIMATE.start_main_~end~0.base 0))} assume 0 != main_~end~0.base || 0 != main_~end~0.offset; {5629#false} is VALID [2020-07-28 18:00:07,505 INFO L280 TraceCheckUtils]: 24: Hoare triple {5629#false} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {5629#false} is VALID [2020-07-28 18:00:07,506 INFO L280 TraceCheckUtils]: 25: Hoare triple {5629#false} assume !false; {5629#false} is VALID [2020-07-28 18:00:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:00:07,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504786579] [2020-07-28 18:00:07,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:07,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:00:07,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500909589] [2020-07-28 18:00:07,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-28 18:00:07,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:07,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:00:07,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:07,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:00:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:00:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:00:07,547 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand 4 states. [2020-07-28 18:00:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:07,997 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2020-07-28 18:00:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:00:07,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-07-28 18:00:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2020-07-28 18:00:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:00:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2020-07-28 18:00:08,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2020-07-28 18:00:08,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:08,194 INFO L225 Difference]: With dead ends: 163 [2020-07-28 18:00:08,194 INFO L226 Difference]: Without dead ends: 145 [2020-07-28 18:00:08,195 INFO L675 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 [2020-07-28 18:00:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-07-28 18:00:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2020-07-28 18:00:08,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:08,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 137 states. [2020-07-28 18:00:08,319 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 137 states. [2020-07-28 18:00:08,319 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 137 states. [2020-07-28 18:00:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:08,322 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2020-07-28 18:00:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2020-07-28 18:00:08,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:08,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:08,323 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 145 states. [2020-07-28 18:00:08,323 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 145 states. [2020-07-28 18:00:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:08,327 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2020-07-28 18:00:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2020-07-28 18:00:08,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:08,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:08,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:08,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-28 18:00:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 163 transitions. [2020-07-28 18:00:08,332 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 163 transitions. Word has length 26 [2020-07-28 18:00:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:08,332 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 163 transitions. [2020-07-28 18:00:08,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:00:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 163 transitions. [2020-07-28 18:00:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:00:08,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:08,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:08,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-28 18:00:08,336 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2020-07-28 18:00:08,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:08,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144923280] [2020-07-28 18:00:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:00:08,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {6267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6267#true} is VALID [2020-07-28 18:00:08,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {6267#true} havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~short7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~short18, main_#t~nondet8, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_~len~0, main_~inner~0.base, main_~inner~0.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~list~0.base, main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_~list~0.base, 4 + main_~list~0.offset, 4); {6267#true} is VALID [2020-07-28 18:00:08,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {6267#true} assume !!(main_~list~0.base != 0 || main_~list~0.offset != 0); {6267#true} is VALID [2020-07-28 18:00:08,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {6267#true} goto; {6267#true} is VALID [2020-07-28 18:00:08,402 INFO L280 TraceCheckUtils]: 4: Hoare triple {6267#true} assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; {6267#true} is VALID [2020-07-28 18:00:08,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {6267#true} assume !(0 != main_#t~nondet1);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~list~0.base, 8 + main_~list~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem3.base, main_#t~mem3.offset, 4);havoc main_#t~mem3.base, main_#t~mem3.offset;call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4.base, 8 + main_#t~mem4.offset, 4);havoc main_#t~mem4.base, main_#t~mem4.offset; {6267#true} is VALID [2020-07-28 18:00:08,402 INFO L280 TraceCheckUtils]: 6: Hoare triple {6267#true} call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_#t~short7 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; {6267#true} is VALID [2020-07-28 18:00:08,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {6267#true} assume main_#t~short7; {6267#true} is VALID [2020-07-28 18:00:08,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {6267#true} assume !!main_#t~short7;havoc main_#t~short7;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem5.base, main_#t~mem5.offset; {6267#true} is VALID [2020-07-28 18:00:08,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {6267#true} goto; {6267#true} is VALID [2020-07-28 18:00:08,403 INFO L280 TraceCheckUtils]: 10: Hoare triple {6267#true} main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {6267#true} is VALID [2020-07-28 18:00:08,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {6267#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {6267#true} is VALID [2020-07-28 18:00:08,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {6267#true} assume !(0 != main_#t~nondet8);havoc main_#t~nondet8; {6267#true} is VALID [2020-07-28 18:00:08,403 INFO L280 TraceCheckUtils]: 13: Hoare triple {6267#true} main_~end~0.base, main_~end~0.offset := 0, 0;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; {6267#true} is VALID [2020-07-28 18:00:08,404 INFO L280 TraceCheckUtils]: 14: Hoare triple {6267#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset); {6267#true} is VALID [2020-07-28 18:00:08,404 INFO L280 TraceCheckUtils]: 15: Hoare triple {6267#true} goto; {6267#true} is VALID [2020-07-28 18:00:08,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {6267#true} assume !!(0 != main_~end~0.base || 0 != main_~end~0.offset);main_~len~0 := 0;call main_#t~mem19.base, main_#t~mem19.offset := read~$Pointer$(main_~end~0.base, 8 + main_~end~0.offset, 4);main_~inner~0.base, main_~inner~0.offset := main_#t~mem19.base, main_#t~mem19.offset;havoc main_#t~mem19.base, main_#t~mem19.offset; {6267#true} is VALID [2020-07-28 18:00:08,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {6267#true} assume !(0 != main_~inner~0.base || 0 != main_~inner~0.offset); {6267#true} is VALID [2020-07-28 18:00:08,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {6267#true} assume !!(main_~len~0 <= 1); {6267#true} is VALID [2020-07-28 18:00:08,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {6267#true} goto; {6267#true} is VALID [2020-07-28 18:00:08,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {6267#true} call main_#t~mem23.base, main_#t~mem23.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem23.base, main_#t~mem23.offset;havoc main_#t~mem23.base, main_#t~mem23.offset; {6267#true} is VALID [2020-07-28 18:00:08,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {6267#true} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {6267#true} is VALID [2020-07-28 18:00:08,405 INFO L280 TraceCheckUtils]: 22: Hoare triple {6267#true} assume !!(0 != main_~list~0.base || 0 != main_~list~0.offset);call main_#t~mem24.base, main_#t~mem24.offset := read~$Pointer$(main_~list~0.base, 8 + main_~list~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem24.base, main_#t~mem24.offset;havoc main_#t~mem24.base, main_#t~mem24.offset; {6267#true} is VALID [2020-07-28 18:00:08,412 INFO L280 TraceCheckUtils]: 23: Hoare triple {6267#true} assume 0 != main_~end~0.base || 0 != main_~end~0.offset; {6269#(or (not (= ULTIMATE.start_main_~end~0.base 0)) (not (= 0 ULTIMATE.start_main_~end~0.offset)))} is VALID [2020-07-28 18:00:08,412 INFO L280 TraceCheckUtils]: 24: Hoare triple {6269#(or (not (= ULTIMATE.start_main_~end~0.base 0)) (not (= 0 ULTIMATE.start_main_~end~0.offset)))} assume !(0 != main_~end~0.base || 0 != main_~end~0.offset); {6268#false} is VALID [2020-07-28 18:00:08,413 INFO L280 TraceCheckUtils]: 25: Hoare triple {6268#false} assume !false; {6268#false} is VALID [2020-07-28 18:00:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:00:08,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144923280] [2020-07-28 18:00:08,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:00:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:00:08,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685862129] [2020-07-28 18:00:08,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-28 18:00:08,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:00:08,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:00:08,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:08,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:00:08,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:00:08,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:00:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:00:08,443 INFO L87 Difference]: Start difference. First operand 137 states and 163 transitions. Second operand 3 states. [2020-07-28 18:00:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:08,690 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2020-07-28 18:00:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:00:08,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-28 18:00:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:00:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:00:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2020-07-28 18:00:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:00:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2020-07-28 18:00:08,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2020-07-28 18:00:08,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:00:08,789 INFO L225 Difference]: With dead ends: 137 [2020-07-28 18:00:08,789 INFO L226 Difference]: Without dead ends: 135 [2020-07-28 18:00:08,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:00:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-28 18:00:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-07-28 18:00:08,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:00:08,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 135 states. [2020-07-28 18:00:08,914 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2020-07-28 18:00:08,914 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2020-07-28 18:00:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:08,918 INFO L93 Difference]: Finished difference Result 135 states and 161 transitions. [2020-07-28 18:00:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2020-07-28 18:00:08,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:08,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:08,919 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2020-07-28 18:00:08,920 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2020-07-28 18:00:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:00:08,923 INFO L93 Difference]: Finished difference Result 135 states and 161 transitions. [2020-07-28 18:00:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2020-07-28 18:00:08,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:00:08,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:00:08,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:00:08,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:00:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-28 18:00:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2020-07-28 18:00:08,929 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 26 [2020-07-28 18:00:08,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:00:08,929 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2020-07-28 18:00:08,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:00:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2020-07-28 18:00:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-28 18:00:08,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:00:08,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:00:08,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-28 18:00:08,932 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:00:08,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:00:08,933 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2020-07-28 18:00:08,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:00:08,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68870350] [2020-07-28 18:00:08,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:00:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:00:08,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:00:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:00:09,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:00:09,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:00:09,059 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:00:09,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-28 18:00:09,118 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:00:09,118 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:00:09,119 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-28 18:00:09,119 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-28 18:00:09,119 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-28 18:00:09,119 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-28 18:00:09,119 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-28 18:00:09,119 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-28 18:00:09,120 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-28 18:00:09,120 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-28 18:00:09,120 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-28 18:00:09,120 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-28 18:00:09,120 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-28 18:00:09,120 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L995-16 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-28 18:00:09,121 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-28 18:00:09,122 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-28 18:00:09,122 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-28 18:00:09,122 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-28 18:00:09,122 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-28 18:00:09,122 WARN L170 areAnnotationChecker]: L1000-3 has no Hoare annotation [2020-07-28 18:00:09,122 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-28 18:00:09,123 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-28 18:00:09,123 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-28 18:00:09,123 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-28 18:00:09,123 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-28 18:00:09,123 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-28 18:00:09,123 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-28 18:00:09,124 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-28 18:00:09,124 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-28 18:00:09,124 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-28 18:00:09,124 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-28 18:00:09,124 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-28 18:00:09,124 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-28 18:00:09,125 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-28 18:00:09,125 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-28 18:00:09,125 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-28 18:00:09,125 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-28 18:00:09,125 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-28 18:00:09,125 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-28 18:00:09,126 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-28 18:00:09,126 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-28 18:00:09,126 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-28 18:00:09,126 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-28 18:00:09,126 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-28 18:00:09,126 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-28 18:00:09,127 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 18:00:09,127 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 18:00:09,127 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-28 18:00:09,127 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-28 18:00:09,127 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-28 18:00:09,127 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-28 18:00:09,128 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-28 18:00:09,128 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-28 18:00:09,128 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-28 18:00:09,128 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-28 18:00:09,128 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-28 18:00:09,128 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-28 18:00:09,129 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-28 18:00:09,129 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-28 18:00:09,129 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-28 18:00:09,129 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-28 18:00:09,129 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-28 18:00:09,129 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-28 18:00:09,130 WARN L170 areAnnotationChecker]: L1055 has no Hoare annotation [2020-07-28 18:00:09,130 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-28 18:00:09,130 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-28 18:00:09,130 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-28 18:00:09,130 WARN L170 areAnnotationChecker]: L1042-2 has no Hoare annotation [2020-07-28 18:00:09,130 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-28 18:00:09,131 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-28 18:00:09,132 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-28 18:00:09,132 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-28 18:00:09,132 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:00:09,132 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-28 18:00:09,132 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-28 18:00:09,132 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-28 18:00:09,133 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-28 18:00:09,133 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-28 18:00:09,133 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-28 18:00:09,133 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-28 18:00:09,133 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-28 18:00:09,133 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1008-8 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1008-8 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-28 18:00:09,134 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-28 18:00:09,135 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-28 18:00:09,136 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1046-3 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1046-3 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-28 18:00:09,137 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-28 18:00:09,137 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:00:09,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:00:09 BoogieIcfgContainer [2020-07-28 18:00:09,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:00:09,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:00:09,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:00:09,141 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:00:09,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:59:56" (3/4) ... [2020-07-28 18:00:09,144 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:00:09,208 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:00:09,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:00:09,212 INFO L168 Benchmark]: Toolchain (without parser) took 14323.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 942.8 MB in the beginning and 1.2 GB in the end (delta: -242.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:09,213 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 976.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:00:09,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:09,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:09,214 INFO L168 Benchmark]: Boogie Preprocessor took 71.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:00:09,215 INFO L168 Benchmark]: RCFGBuilder took 856.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:09,215 INFO L168 Benchmark]: TraceAbstraction took 12586.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.1 MB). Peak memory consumption was 87.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:09,216 INFO L168 Benchmark]: Witness Printer took 67.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:00:09,218 INFO L336 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 976.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 658.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 856.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12586.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.1 MB). Peak memory consumption was 87.8 MB. Max. memory is 11.5 GB. * Witness Printer took 67.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) [L995] COND FALSE !(!(list != ((void*)0))) [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list [L1015] COND FALSE !(!(((void*)0) != end)) [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner [L1023] COND TRUE len == 0 [L1024] len = 1 [L1027] COND FALSE !(!(((void*)0) != inner)) [L1028] EXPR inner->inner [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 982 SDtfs, 1156 SDslu, 1300 SDs, 0 SdLazy, 657 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 377 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 37230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...