./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_max_incorrect.c --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/verifythis/tree_max_incorrect.c -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 d175b23e7b65a104262a874bc9fb10ae6a765c43 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/verifythis/tree_max_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d175b23e7b65a104262a874bc9fb10ae6a765c43 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:13:49,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:13:49,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:13:49,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:13:49,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:13:49,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:13:49,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:13:49,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:13:49,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:13:49,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:13:49,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:13:49,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:13:49,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:13:49,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:13:49,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:13:49,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:13:49,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:13:49,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:13:49,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:13:49,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:13:49,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:13:49,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:13:49,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:13:49,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:13:49,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:13:49,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:13:49,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:13:49,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:13:49,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:13:49,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:13:49,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:13:49,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:13:49,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:13:49,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:13:49,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:13:49,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:13:49,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:13:49,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:13:49,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:13:49,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:13:49,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:13:49,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:13:49,447 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:13:49,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:13:49,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:13:49,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:13:49,449 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:13:49,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:13:49,449 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:13:49,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:13:49,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:13:49,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:13:49,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:13:49,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:13:49,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:13:49,451 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:13:49,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:13:49,452 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:13:49,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:13:49,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:13:49,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:13:49,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:13:49,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:13:49,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:49,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:13:49,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:13:49,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:13:49,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:13:49,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:13:49,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:13:49,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:13:49,456 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 -> d175b23e7b65a104262a874bc9fb10ae6a765c43 [2020-07-28 19:13:49,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:13:49,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:13:49,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:13:49,782 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:13:49,783 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:13:49,784 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max_incorrect.c [2020-07-28 19:13:49,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccfc9a8/b2515c8fefbc4b63b88dd0c01cdba8a8/FLAGff0001579 [2020-07-28 19:13:50,260 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:13:50,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c [2020-07-28 19:13:50,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccfc9a8/b2515c8fefbc4b63b88dd0c01cdba8a8/FLAGff0001579 [2020-07-28 19:13:50,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccfc9a8/b2515c8fefbc4b63b88dd0c01cdba8a8 [2020-07-28 19:13:50,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:13:50,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:13:50,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:50,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:13:50,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:13:50,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:50,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75777b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50, skipping insertion in model container [2020-07-28 19:13:50,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:50,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:13:50,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:13:50,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:50,904 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:13:50,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:50,947 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:13:50,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50 WrapperNode [2020-07-28 19:13:50,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:50,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:50,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:13:50,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:13:50,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:51,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:13:51,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:13:51,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:13:51,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (1/1) ... [2020-07-28 19:13:51,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:13:51,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:13:51,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:13:51,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:13:51,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (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 19:13:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 19:13:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure max [2020-07-28 19:13:51,211 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2020-07-28 19:13:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-28 19:13:51,212 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-28 19:13:51,213 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-28 19:13:51,213 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-28 19:13:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 19:13:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 19:13:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 19:13:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:13:51,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:13:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 19:13:51,641 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:13:51,641 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 19:13:51,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:51 BoogieIcfgContainer [2020-07-28 19:13:51,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:13:51,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:13:51,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:13:51,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:13:51,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:13:50" (1/3) ... [2020-07-28 19:13:51,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b916db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:51, skipping insertion in model container [2020-07-28 19:13:51,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:50" (2/3) ... [2020-07-28 19:13:51,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b916db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:51, skipping insertion in model container [2020-07-28 19:13:51,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:51" (3/3) ... [2020-07-28 19:13:51,656 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2020-07-28 19:13:51,667 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:13:51,675 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:13:51,690 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:13:51,720 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:13:51,726 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:13:51,726 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:13:51,726 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:13:51,726 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:13:51,726 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:13:51,728 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:13:51,728 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:13:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-28 19:13:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 19:13:51,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:51,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:51,775 INFO L427 AbstractCegarLoop]: === Iteration 1 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash -891537794, now seen corresponding path program 1 times [2020-07-28 19:13:51,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:51,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491620718] [2020-07-28 19:13:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,275 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {43#true} #72#return; {48#(and (= 0 |ULTIMATE.start_main_#t~ret15.offset|) (= 0 |ULTIMATE.start_main_#t~ret15.base|))} is VALID [2020-07-28 19:13:52,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-28 19:13:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:52,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2020-07-28 19:13:52,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {43#true} is VALID [2020-07-28 19:13:52,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-28 19:13:52,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} #74#return; {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:52,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-28 19:13:52,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~ret15.base, main_#t~ret15.offset; {43#true} is VALID [2020-07-28 19:13:52,298 INFO L263 TraceCheckUtils]: 2: Hoare triple {43#true} call main_#t~ret15.base, main_#t~ret15.offset := nondet_tree(); {56#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:52,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,301 INFO L280 TraceCheckUtils]: 4: Hoare triple {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-28 19:13:52,304 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {57#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {43#true} #72#return; {48#(and (= 0 |ULTIMATE.start_main_#t~ret15.offset|) (= 0 |ULTIMATE.start_main_#t~ret15.base|))} is VALID [2020-07-28 19:13:52,306 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#(and (= 0 |ULTIMATE.start_main_#t~ret15.offset|) (= 0 |ULTIMATE.start_main_#t~ret15.base|))} task_#in~n.base, task_#in~n.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc task_#t~ret14, task_~n.base, task_~n.offset, task_~a~1;task_~n.base, task_~n.offset := task_#in~n.base, task_#in~n.offset; {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:52,307 INFO L263 TraceCheckUtils]: 7: Hoare triple {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} call task_#t~ret14 := max(task_~n.base, task_~n.offset); {43#true} is VALID [2020-07-28 19:13:52,307 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2020-07-28 19:13:52,308 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {43#true} is VALID [2020-07-28 19:13:52,308 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-28 19:13:52,310 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {43#true} {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} #74#return; {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:52,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} assume -2147483648 <= task_#t~ret14 && task_#t~ret14 <= 2147483647;task_~a~1 := task_#t~ret14;havoc task_#t~ret14; {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:52,316 INFO L263 TraceCheckUtils]: 13: Hoare triple {49#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} call check(task_~n.base, task_~n.offset, task_~a~1); {54#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} is VALID [2020-07-28 19:13:52,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {55#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-28 19:13:52,319 INFO L280 TraceCheckUtils]: 15: Hoare triple {55#(and (= 0 check_~n.offset) (= 0 check_~n.base))} assume ~n.base != 0 || ~n.offset != 0;call #t~mem10 := read~int(~n.base, ~n.offset, 4);__VERIFIER_assert_#in~cond := (if #t~mem10 <= ~a then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {44#false} is VALID [2020-07-28 19:13:52,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond; {44#false} is VALID [2020-07-28 19:13:52,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-28 19:13:52,325 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 19:13:52,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491620718] [2020-07-28 19:13:52,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:52,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-28 19:13:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492286972] [2020-07-28 19:13:52,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-28 19:13:52,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:52,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 19:13:52,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:52,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 19:13:52,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 19:13:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:13:52,398 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 8 states. [2020-07-28 19:13:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:53,676 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2020-07-28 19:13:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 19:13:53,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-28 19:13:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:13:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-28 19:13:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:13:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2020-07-28 19:13:53,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2020-07-28 19:13:53,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:53,906 INFO L225 Difference]: With dead ends: 73 [2020-07-28 19:13:53,906 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 19:13:53,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-28 19:13:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 19:13:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-28 19:13:53,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:53,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2020-07-28 19:13:53,971 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 19:13:53,971 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 19:13:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:53,979 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-28 19:13:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-28 19:13:53,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:53,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:53,981 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 19:13:53,981 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 19:13:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:53,987 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-28 19:13:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-28 19:13:53,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:53,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:53,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:53,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-28 19:13:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-07-28 19:13:53,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 18 [2020-07-28 19:13:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:53,997 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-28 19:13:53,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 19:13:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-28 19:13:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-28 19:13:54,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:54,000 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 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 19:13:54,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:13:54,001 INFO L427 AbstractCegarLoop]: === Iteration 2 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1509693249, now seen corresponding path program 1 times [2020-07-28 19:13:54,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:54,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215811327] [2020-07-28 19:13:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:54,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:54,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:13:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:54,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {275#true} is VALID [2020-07-28 19:13:54,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2020-07-28 19:13:54,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {275#true} {300#(= nondet_tree_~n~0.offset 0)} #68#return; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-07-28 19:13:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:54,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {275#true} is VALID [2020-07-28 19:13:54,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2020-07-28 19:13:54,364 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {275#true} {300#(= nondet_tree_~n~0.offset 0)} #70#return; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,368 INFO L263 TraceCheckUtils]: 1: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:54,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {275#true} is VALID [2020-07-28 19:13:54,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#true} assume true; {275#true} is VALID [2020-07-28 19:13:54,370 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {275#true} {300#(= nondet_tree_~n~0.offset 0)} #68#return; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,373 INFO L263 TraceCheckUtils]: 6: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:54,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {275#true} is VALID [2020-07-28 19:13:54,374 INFO L280 TraceCheckUtils]: 8: Hoare triple {275#true} assume true; {275#true} is VALID [2020-07-28 19:13:54,375 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {275#true} {300#(= nondet_tree_~n~0.offset 0)} #70#return; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,376 INFO L280 TraceCheckUtils]: 10: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {307#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:54,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#(= 0 |nondet_tree_#res.offset|)} assume true; {307#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:54,378 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {307#(= 0 |nondet_tree_#res.offset|)} {275#true} #72#return; {290#(= 0 |ULTIMATE.start_main_#t~ret15.offset|)} is VALID [2020-07-28 19:13:54,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-07-28 19:13:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:54,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {275#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {308#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-28 19:13:54,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {309#(= 0 |max_#in~n.base|)} is VALID [2020-07-28 19:13:54,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#(= 0 |max_#in~n.base|)} assume true; {309#(= 0 |max_#in~n.base|)} is VALID [2020-07-28 19:13:54,446 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {309#(= 0 |max_#in~n.base|)} {291#(= 0 ULTIMATE.start_task_~n.offset)} #74#return; {296#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:54,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {275#true} is VALID [2020-07-28 19:13:54,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {275#true} havoc main_#res;havoc main_#t~ret15.base, main_#t~ret15.offset; {275#true} is VALID [2020-07-28 19:13:54,448 INFO L263 TraceCheckUtils]: 2: Hoare triple {275#true} call main_#t~ret15.base, main_#t~ret15.offset := nondet_tree(); {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:54,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,451 INFO L263 TraceCheckUtils]: 4: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:54,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {275#true} is VALID [2020-07-28 19:13:54,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#true} assume true; {275#true} is VALID [2020-07-28 19:13:54,453 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {275#true} {300#(= nondet_tree_~n~0.offset 0)} #68#return; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,455 INFO L263 TraceCheckUtils]: 9: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-28 19:13:54,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {275#true} is VALID [2020-07-28 19:13:54,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {275#true} assume true; {275#true} is VALID [2020-07-28 19:13:54,457 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {275#true} {300#(= nondet_tree_~n~0.offset 0)} #70#return; {300#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-28 19:13:54,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {300#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {307#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:54,460 INFO L280 TraceCheckUtils]: 14: Hoare triple {307#(= 0 |nondet_tree_#res.offset|)} assume true; {307#(= 0 |nondet_tree_#res.offset|)} is VALID [2020-07-28 19:13:54,461 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {307#(= 0 |nondet_tree_#res.offset|)} {275#true} #72#return; {290#(= 0 |ULTIMATE.start_main_#t~ret15.offset|)} is VALID [2020-07-28 19:13:54,462 INFO L280 TraceCheckUtils]: 16: Hoare triple {290#(= 0 |ULTIMATE.start_main_#t~ret15.offset|)} task_#in~n.base, task_#in~n.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc task_#t~ret14, task_~n.base, task_~n.offset, task_~a~1;task_~n.base, task_~n.offset := task_#in~n.base, task_#in~n.offset; {291#(= 0 ULTIMATE.start_task_~n.offset)} is VALID [2020-07-28 19:13:54,463 INFO L263 TraceCheckUtils]: 17: Hoare triple {291#(= 0 ULTIMATE.start_task_~n.offset)} call task_#t~ret14 := max(task_~n.base, task_~n.offset); {275#true} is VALID [2020-07-28 19:13:54,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {275#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {308#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-28 19:13:54,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {308#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {309#(= 0 |max_#in~n.base|)} is VALID [2020-07-28 19:13:54,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {309#(= 0 |max_#in~n.base|)} assume true; {309#(= 0 |max_#in~n.base|)} is VALID [2020-07-28 19:13:54,466 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {309#(= 0 |max_#in~n.base|)} {291#(= 0 ULTIMATE.start_task_~n.offset)} #74#return; {296#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:54,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {296#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} assume -2147483648 <= task_#t~ret14 && task_#t~ret14 <= 2147483647;task_~a~1 := task_#t~ret14;havoc task_#t~ret14; {296#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:13:54,469 INFO L263 TraceCheckUtils]: 23: Hoare triple {296#(and (= 0 ULTIMATE.start_task_~n.offset) (= 0 ULTIMATE.start_task_~n.base))} call check(task_~n.base, task_~n.offset, task_~a~1); {297#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} is VALID [2020-07-28 19:13:54,470 INFO L280 TraceCheckUtils]: 24: Hoare triple {297#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {298#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-28 19:13:54,471 INFO L280 TraceCheckUtils]: 25: Hoare triple {298#(and (= 0 check_~n.offset) (= 0 check_~n.base))} assume ~n.base != 0 || ~n.offset != 0;call #t~mem10 := read~int(~n.base, ~n.offset, 4);__VERIFIER_assert_#in~cond := (if #t~mem10 <= ~a then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {276#false} is VALID [2020-07-28 19:13:54,471 INFO L280 TraceCheckUtils]: 26: Hoare triple {276#false} assume 0 == __VERIFIER_assert_~cond; {276#false} is VALID [2020-07-28 19:13:54,472 INFO L280 TraceCheckUtils]: 27: Hoare triple {276#false} assume !false; {276#false} is VALID [2020-07-28 19:13:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 19:13:54,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215811327] [2020-07-28 19:13:54,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:54,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-28 19:13:54,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685614574] [2020-07-28 19:13:54,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-28 19:13:54,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:54,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 19:13:54,512 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 19:13:54,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 19:13:54,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 19:13:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:13:54,513 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 12 states. [2020-07-28 19:13:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:55,619 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2020-07-28 19:13:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 19:13:55,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-28 19:13:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:13:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2020-07-28 19:13:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 19:13:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2020-07-28 19:13:55,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2020-07-28 19:13:55,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:55,717 INFO L225 Difference]: With dead ends: 49 [2020-07-28 19:13:55,717 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 19:13:55,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2020-07-28 19:13:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 19:13:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-28 19:13:55,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:55,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-28 19:13:55,744 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-28 19:13:55,744 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-28 19:13:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:55,749 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-28 19:13:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-28 19:13:55,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:55,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:55,750 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-28 19:13:55,751 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-28 19:13:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:55,755 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-28 19:13:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-28 19:13:55,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:55,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:55,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:55,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-28 19:13:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-07-28 19:13:55,760 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 28 [2020-07-28 19:13:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:55,760 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-28 19:13:55,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 19:13:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-28 19:13:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-28 19:13:55,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:55,763 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:55,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:13:55,763 INFO L427 AbstractCegarLoop]: === Iteration 3 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -896236761, now seen corresponding path program 1 times [2020-07-28 19:13:55,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:55,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574954472] [2020-07-28 19:13:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:13:55,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:13:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:13:55,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:13:55,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 19:13:55,869 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:13:55,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 19:13:55,921 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret15 := nondet_tree(); [2020-07-28 19:13:55,923 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:13:55,930 INFO L168 Benchmark]: Toolchain (without parser) took 5264.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 949.5 MB in the beginning and 969.0 MB in the end (delta: -19.5 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:55,931 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:13:55,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.83 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 938.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:55,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:55,933 INFO L168 Benchmark]: Boogie Preprocessor took 64.63 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 19:13:55,934 INFO L168 Benchmark]: RCFGBuilder took 517.23 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: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:55,935 INFO L168 Benchmark]: TraceAbstraction took 4278.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 135.0 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:55,939 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 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.83 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 938.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.63 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 517.23 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: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4278.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 135.0 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:13:57,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:13:57,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:13:57,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:13:57,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:13:57,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:13:57,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:13:57,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:13:58,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:13:58,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:13:58,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:13:58,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:13:58,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:13:58,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:13:58,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:13:58,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:13:58,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:13:58,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:13:58,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:13:58,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:13:58,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:13:58,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:13:58,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:13:58,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:13:58,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:13:58,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:13:58,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:13:58,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:13:58,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:13:58,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:13:58,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:13:58,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:13:58,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:13:58,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:13:58,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:13:58,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:13:58,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:13:58,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:13:58,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:13:58,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:13:58,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:13:58,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 19:13:58,086 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:13:58,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:13:58,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:13:58,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:13:58,088 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:13:58,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:13:58,089 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:13:58,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:13:58,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:13:58,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:13:58,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:13:58,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:13:58,090 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 19:13:58,091 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 19:13:58,091 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:13:58,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:13:58,091 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:13:58,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:13:58,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:13:58,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:13:58,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:13:58,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:13:58,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:58,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:13:58,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:13:58,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:13:58,094 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 19:13:58,095 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 19:13:58,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:13:58,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:13:58,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 19:13:58,096 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> d175b23e7b65a104262a874bc9fb10ae6a765c43 [2020-07-28 19:13:58,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:13:58,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:13:58,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:13:58,415 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:13:58,416 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:13:58,417 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max_incorrect.c [2020-07-28 19:13:58,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860840a64/6b19a21f27254c18b61bb4ac80f926f6/FLAGf6893cab3 [2020-07-28 19:13:58,949 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:13:58,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c [2020-07-28 19:13:58,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860840a64/6b19a21f27254c18b61bb4ac80f926f6/FLAGf6893cab3 [2020-07-28 19:13:59,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860840a64/6b19a21f27254c18b61bb4ac80f926f6 [2020-07-28 19:13:59,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:13:59,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:13:59,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:59,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:13:59,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:13:59,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1728e5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59, skipping insertion in model container [2020-07-28 19:13:59,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:13:59,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:13:59,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:59,541 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:13:59,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:59,579 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:13:59,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59 WrapperNode [2020-07-28 19:13:59,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:59,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:59,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:13:59,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:13:59,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:59,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:13:59,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:13:59,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:13:59,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (1/1) ... [2020-07-28 19:13:59,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:13:59,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:13:59,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:13:59,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:13:59,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (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 19:13:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 19:13:59,780 INFO L130 BoogieDeclarations]: Found specification of procedure max [2020-07-28 19:13:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2020-07-28 19:13:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-28 19:13:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-28 19:13:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-28 19:13:59,781 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-28 19:13:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 19:13:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 19:13:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 19:13:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:13:59,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:13:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 19:14:00,247 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:14:00,247 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 19:14:00,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:14:00 BoogieIcfgContainer [2020-07-28 19:14:00,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:14:00,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:14:00,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:14:00,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:14:00,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:13:59" (1/3) ... [2020-07-28 19:14:00,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2520b18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:14:00, skipping insertion in model container [2020-07-28 19:14:00,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:59" (2/3) ... [2020-07-28 19:14:00,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2520b18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:14:00, skipping insertion in model container [2020-07-28 19:14:00,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:14:00" (3/3) ... [2020-07-28 19:14:00,259 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2020-07-28 19:14:00,268 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:14:00,274 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:14:00,285 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:14:00,307 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:14:00,307 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:14:00,307 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:14:00,307 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:14:00,307 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:14:00,308 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:14:00,308 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:14:00,308 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:14:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-28 19:14:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 19:14:00,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:00,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:00,334 INFO L427 AbstractCegarLoop]: === Iteration 1 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash -891537794, now seen corresponding path program 1 times [2020-07-28 19:14:00,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:00,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159812951] [2020-07-28 19:14:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:00,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 19:14:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:00,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:00,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {43#true} is VALID [2020-07-28 19:14:00,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~ret15.base, main_#t~ret15.offset; {43#true} is VALID [2020-07-28 19:14:00,683 INFO L263 TraceCheckUtils]: 2: Hoare triple {43#true} call main_#t~ret15.base, main_#t~ret15.offset := nondet_tree(); {43#true} is VALID [2020-07-28 19:14:00,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:00,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:00,690 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} {43#true} #72#return; {64#(and (= |ULTIMATE.start_main_#t~ret15.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:00,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {64#(and (= |ULTIMATE.start_main_#t~ret15.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} task_#in~n.base, task_#in~n.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc task_#t~ret14, task_~n.base, task_~n.offset, task_~a~1;task_~n.base, task_~n.offset := task_#in~n.base, task_#in~n.offset; {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:00,692 INFO L263 TraceCheckUtils]: 7: Hoare triple {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} call task_#t~ret14 := max(task_~n.base, task_~n.offset); {43#true} is VALID [2020-07-28 19:14:00,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2020-07-28 19:14:00,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483648bv32; {43#true} is VALID [2020-07-28 19:14:00,693 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-28 19:14:00,697 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {43#true} {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} #74#return; {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:00,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} task_~a~1 := task_#t~ret14;havoc task_#t~ret14; {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:00,701 INFO L263 TraceCheckUtils]: 13: Hoare triple {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} call check(task_~n.base, task_~n.offset, task_~a~1); {90#(and (= |check_#in~n.base| (_ bv0 32)) (= |check_#in~n.offset| (_ bv0 32)))} is VALID [2020-07-28 19:14:00,705 INFO L280 TraceCheckUtils]: 14: Hoare triple {90#(and (= |check_#in~n.base| (_ bv0 32)) (= |check_#in~n.offset| (_ bv0 32)))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {94#(and (= (_ bv0 32) check_~n.base) (= check_~n.offset (_ bv0 32)))} is VALID [2020-07-28 19:14:00,706 INFO L280 TraceCheckUtils]: 15: Hoare triple {94#(and (= (_ bv0 32) check_~n.base) (= check_~n.offset (_ bv0 32)))} assume ~n.base != 0bv32 || ~n.offset != 0bv32;call #t~mem10 := read~intINTTYPE4(~n.base, ~n.offset, 4bv32);__VERIFIER_assert_#in~cond := (if ~bvsle32(#t~mem10, ~a) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {44#false} is VALID [2020-07-28 19:14:00,707 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2020-07-28 19:14:00,707 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-28 19:14:00,713 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 19:14:00,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:00,875 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-28 19:14:00,875 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2020-07-28 19:14:00,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {94#(and (= (_ bv0 32) check_~n.base) (= check_~n.offset (_ bv0 32)))} assume ~n.base != 0bv32 || ~n.offset != 0bv32;call #t~mem10 := read~intINTTYPE4(~n.base, ~n.offset, 4bv32);__VERIFIER_assert_#in~cond := (if ~bvsle32(#t~mem10, ~a) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {44#false} is VALID [2020-07-28 19:14:00,878 INFO L280 TraceCheckUtils]: 14: Hoare triple {90#(and (= |check_#in~n.base| (_ bv0 32)) (= |check_#in~n.offset| (_ bv0 32)))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {94#(and (= (_ bv0 32) check_~n.base) (= check_~n.offset (_ bv0 32)))} is VALID [2020-07-28 19:14:00,880 INFO L263 TraceCheckUtils]: 13: Hoare triple {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} call check(task_~n.base, task_~n.offset, task_~a~1); {90#(and (= |check_#in~n.base| (_ bv0 32)) (= |check_#in~n.offset| (_ bv0 32)))} is VALID [2020-07-28 19:14:00,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} task_~a~1 := task_#t~ret14;havoc task_#t~ret14; {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:00,883 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {43#true} {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} #74#return; {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:00,884 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-28 19:14:00,884 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483648bv32; {43#true} is VALID [2020-07-28 19:14:00,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {43#true} is VALID [2020-07-28 19:14:00,885 INFO L263 TraceCheckUtils]: 7: Hoare triple {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} call task_#t~ret14 := max(task_~n.base, task_~n.offset); {43#true} is VALID [2020-07-28 19:14:00,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {64#(and (= |ULTIMATE.start_main_#t~ret15.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} task_#in~n.base, task_#in~n.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc task_#t~ret14, task_~n.base, task_~n.offset, task_~a~1;task_~n.base, task_~n.offset := task_#in~n.base, task_#in~n.offset; {68#(and (= ULTIMATE.start_task_~n.offset (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:00,888 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} {43#true} #72#return; {64#(and (= |ULTIMATE.start_main_#t~ret15.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:00,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:00,891 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {57#(and (= |nondet_tree_#res.offset| (_ bv0 32)) (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:00,891 INFO L263 TraceCheckUtils]: 2: Hoare triple {43#true} call main_#t~ret15.base, main_#t~ret15.offset := nondet_tree(); {43#true} is VALID [2020-07-28 19:14:00,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~ret15.base, main_#t~ret15.offset; {43#true} is VALID [2020-07-28 19:14:00,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {43#true} is VALID [2020-07-28 19:14:00,894 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 19:14:00,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159812951] [2020-07-28 19:14:00,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:14:00,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2020-07-28 19:14:00,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798762012] [2020-07-28 19:14:00,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-28 19:14:00,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:00,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:14:00,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:00,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:14:00,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:14:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:14:00,963 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 7 states. [2020-07-28 19:14:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:01,782 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2020-07-28 19:14:01,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 19:14:01,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-28 19:14:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:14:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2020-07-28 19:14:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:14:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2020-07-28 19:14:01,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 96 transitions. [2020-07-28 19:14:01,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:02,009 INFO L225 Difference]: With dead ends: 73 [2020-07-28 19:14:02,009 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 19:14:02,014 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:14:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 19:14:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-28 19:14:02,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:02,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2020-07-28 19:14:02,071 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 19:14:02,071 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 19:14:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:02,078 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-28 19:14:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-28 19:14:02,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:02,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:02,080 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 19:14:02,081 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 19:14:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:02,089 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-28 19:14:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-28 19:14:02,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:02,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:02,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:02,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-28 19:14:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2020-07-28 19:14:02,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 18 [2020-07-28 19:14:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:02,099 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-28 19:14:02,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:14:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-28 19:14:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-28 19:14:02,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:02,102 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 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 19:14:02,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 19:14:02,313 INFO L427 AbstractCegarLoop]: === Iteration 2 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1509693249, now seen corresponding path program 1 times [2020-07-28 19:14:02,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:02,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406542984] [2020-07-28 19:14:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:02,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 19:14:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:14:02,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:14:02,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {363#true} is VALID [2020-07-28 19:14:02,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} havoc main_#res;havoc main_#t~ret15.base, main_#t~ret15.offset; {363#true} is VALID [2020-07-28 19:14:02,544 INFO L263 TraceCheckUtils]: 2: Hoare triple {363#true} call main_#t~ret15.base, main_#t~ret15.offset := nondet_tree(); {363#true} is VALID [2020-07-28 19:14:02,546 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#true} assume !(0bv8 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(#t~nondet3, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet3; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,546 INFO L263 TraceCheckUtils]: 4: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {363#true} is VALID [2020-07-28 19:14:02,547 INFO L280 TraceCheckUtils]: 5: Hoare triple {363#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {363#true} is VALID [2020-07-28 19:14:02,547 INFO L280 TraceCheckUtils]: 6: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-28 19:14:02,549 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {363#true} {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #68#return; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret4.base, #t~ret4.offset; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,551 INFO L263 TraceCheckUtils]: 9: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {363#true} is VALID [2020-07-28 19:14:02,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {363#true} is VALID [2020-07-28 19:14:02,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-28 19:14:02,554 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {363#true} {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #70#return; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:02,556 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:02,558 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} {363#true} #72#return; {415#(not (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:02,560 INFO L280 TraceCheckUtils]: 16: Hoare triple {415#(not (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} task_#in~n.base, task_#in~n.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc task_#t~ret14, task_~n.base, task_~n.offset, task_~a~1;task_~n.base, task_~n.offset := task_#in~n.base, task_#in~n.offset; {419#(not (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:02,560 INFO L263 TraceCheckUtils]: 17: Hoare triple {419#(not (= (_ bv0 32) ULTIMATE.start_task_~n.base))} call task_#t~ret14 := max(task_~n.base, task_~n.offset); {363#true} is VALID [2020-07-28 19:14:02,561 INFO L280 TraceCheckUtils]: 18: Hoare triple {363#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {426#(= |max_#in~n.base| max_~n.base)} is VALID [2020-07-28 19:14:02,562 INFO L280 TraceCheckUtils]: 19: Hoare triple {426#(= |max_#in~n.base| max_~n.base)} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483648bv32; {430#(= |max_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:02,563 INFO L280 TraceCheckUtils]: 20: Hoare triple {430#(= |max_#in~n.base| (_ bv0 32))} assume true; {430#(= |max_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:02,565 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {430#(= |max_#in~n.base| (_ bv0 32))} {419#(not (= (_ bv0 32) ULTIMATE.start_task_~n.base))} #74#return; {364#false} is VALID [2020-07-28 19:14:02,566 INFO L280 TraceCheckUtils]: 22: Hoare triple {364#false} task_~a~1 := task_#t~ret14;havoc task_#t~ret14; {364#false} is VALID [2020-07-28 19:14:02,566 INFO L263 TraceCheckUtils]: 23: Hoare triple {364#false} call check(task_~n.base, task_~n.offset, task_~a~1); {364#false} is VALID [2020-07-28 19:14:02,566 INFO L280 TraceCheckUtils]: 24: Hoare triple {364#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {364#false} is VALID [2020-07-28 19:14:02,567 INFO L280 TraceCheckUtils]: 25: Hoare triple {364#false} assume ~n.base != 0bv32 || ~n.offset != 0bv32;call #t~mem10 := read~intINTTYPE4(~n.base, ~n.offset, 4bv32);__VERIFIER_assert_#in~cond := (if ~bvsle32(#t~mem10, ~a) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {364#false} is VALID [2020-07-28 19:14:02,567 INFO L280 TraceCheckUtils]: 26: Hoare triple {364#false} assume 0bv32 == __VERIFIER_assert_~cond; {364#false} is VALID [2020-07-28 19:14:02,567 INFO L280 TraceCheckUtils]: 27: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-28 19:14:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 19:14:02,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:14:02,756 INFO L280 TraceCheckUtils]: 27: Hoare triple {364#false} assume !false; {364#false} is VALID [2020-07-28 19:14:02,756 INFO L280 TraceCheckUtils]: 26: Hoare triple {364#false} assume 0bv32 == __VERIFIER_assert_~cond; {364#false} is VALID [2020-07-28 19:14:02,757 INFO L280 TraceCheckUtils]: 25: Hoare triple {364#false} assume ~n.base != 0bv32 || ~n.offset != 0bv32;call #t~mem10 := read~intINTTYPE4(~n.base, ~n.offset, 4bv32);__VERIFIER_assert_#in~cond := (if ~bvsle32(#t~mem10, ~a) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {364#false} is VALID [2020-07-28 19:14:02,757 INFO L280 TraceCheckUtils]: 24: Hoare triple {364#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {364#false} is VALID [2020-07-28 19:14:02,757 INFO L263 TraceCheckUtils]: 23: Hoare triple {364#false} call check(task_~n.base, task_~n.offset, task_~a~1); {364#false} is VALID [2020-07-28 19:14:02,757 INFO L280 TraceCheckUtils]: 22: Hoare triple {364#false} task_~a~1 := task_#t~ret14;havoc task_#t~ret14; {364#false} is VALID [2020-07-28 19:14:02,759 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {430#(= |max_#in~n.base| (_ bv0 32))} {419#(not (= (_ bv0 32) ULTIMATE.start_task_~n.base))} #74#return; {364#false} is VALID [2020-07-28 19:14:02,760 INFO L280 TraceCheckUtils]: 20: Hoare triple {430#(= |max_#in~n.base| (_ bv0 32))} assume true; {430#(= |max_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:02,761 INFO L280 TraceCheckUtils]: 19: Hoare triple {482#(or (= |max_#in~n.base| (_ bv0 32)) (not (= (_ bv0 32) max_~n.base)))} assume ~n.base == 0bv32 && ~n.offset == 0bv32;#res := 2147483648bv32; {430#(= |max_#in~n.base| (_ bv0 32))} is VALID [2020-07-28 19:14:02,761 INFO L280 TraceCheckUtils]: 18: Hoare triple {363#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {482#(or (= |max_#in~n.base| (_ bv0 32)) (not (= (_ bv0 32) max_~n.base)))} is VALID [2020-07-28 19:14:02,762 INFO L263 TraceCheckUtils]: 17: Hoare triple {419#(not (= (_ bv0 32) ULTIMATE.start_task_~n.base))} call task_#t~ret14 := max(task_~n.base, task_~n.offset); {363#true} is VALID [2020-07-28 19:14:02,763 INFO L280 TraceCheckUtils]: 16: Hoare triple {415#(not (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} task_#in~n.base, task_#in~n.offset := main_#t~ret15.base, main_#t~ret15.offset;havoc task_#t~ret14, task_~n.base, task_~n.offset, task_~a~1;task_~n.base, task_~n.offset := task_#in~n.base, task_#in~n.offset; {419#(not (= (_ bv0 32) ULTIMATE.start_task_~n.base))} is VALID [2020-07-28 19:14:02,764 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} {363#true} #72#return; {415#(not (= |ULTIMATE.start_main_#t~ret15.base| (_ bv0 32)))} is VALID [2020-07-28 19:14:02,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} assume true; {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:02,766 INFO L280 TraceCheckUtils]: 13: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {408#(not (= (_ bv0 32) |nondet_tree_#res.base|))} is VALID [2020-07-28 19:14:02,767 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {363#true} {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #70#return; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,768 INFO L280 TraceCheckUtils]: 11: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-28 19:14:02,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {363#true} is VALID [2020-07-28 19:14:02,768 INFO L263 TraceCheckUtils]: 9: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {363#true} is VALID [2020-07-28 19:14:02,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);havoc #t~ret4.base, #t~ret4.offset; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,770 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {363#true} {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} #68#return; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {363#true} assume true; {363#true} is VALID [2020-07-28 19:14:02,771 INFO L280 TraceCheckUtils]: 5: Hoare triple {363#true} assume 0bv8 != #t~nondet1;havoc #t~nondet1;#res.base, #res.offset := 0bv32, 0bv32; {363#true} is VALID [2020-07-28 19:14:02,771 INFO L263 TraceCheckUtils]: 4: Hoare triple {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {363#true} is VALID [2020-07-28 19:14:02,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#true} assume !(0bv8 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12bv32);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(#t~nondet3, ~n~0.base, ~n~0.offset, 4bv32);havoc #t~nondet3; {377#(not (= nondet_tree_~n~0.base (_ bv0 32)))} is VALID [2020-07-28 19:14:02,772 INFO L263 TraceCheckUtils]: 2: Hoare triple {363#true} call main_#t~ret15.base, main_#t~ret15.offset := nondet_tree(); {363#true} is VALID [2020-07-28 19:14:02,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#true} havoc main_#res;havoc main_#t~ret15.base, main_#t~ret15.offset; {363#true} is VALID [2020-07-28 19:14:02,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier); {363#true} is VALID [2020-07-28 19:14:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 19:14:02,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406542984] [2020-07-28 19:14:02,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:14:02,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2020-07-28 19:14:02,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432514362] [2020-07-28 19:14:02,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-28 19:14:02,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:14:02,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:14:02,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:02,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:14:02,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:14:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:14:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:14:02,818 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 9 states. [2020-07-28 19:14:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:03,554 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2020-07-28 19:14:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:14:03,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-28 19:14:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:14:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-28 19:14:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:14:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-28 19:14:03,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-28 19:14:03,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:14:03,666 INFO L225 Difference]: With dead ends: 47 [2020-07-28 19:14:03,666 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 19:14:03,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-28 19:14:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 19:14:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-28 19:14:03,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:14:03,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-28 19:14:03,682 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-28 19:14:03,682 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-28 19:14:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:03,687 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-28 19:14:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-28 19:14:03,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:03,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:03,688 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-28 19:14:03,688 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-28 19:14:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:14:03,692 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-28 19:14:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-28 19:14:03,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:14:03,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:14:03,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:14:03,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:14:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-28 19:14:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-07-28 19:14:03,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 28 [2020-07-28 19:14:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:14:03,698 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-28 19:14:03,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:14:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-28 19:14:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-28 19:14:03,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:14:03,700 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:14:03,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 19:14:03,912 INFO L427 AbstractCegarLoop]: === Iteration 3 === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:14:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:14:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash -896236761, now seen corresponding path program 1 times [2020-07-28 19:14:03,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:14:03,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973074033] [2020-07-28 19:14:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 19:14:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:14:03,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:14:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:14:04,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:14:04,122 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 19:14:04,122 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:14:04,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 19:14:04,389 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret15 := nondet_tree(); [2020-07-28 19:14:04,390 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:14:04,399 INFO L168 Benchmark]: Toolchain (without parser) took 5087.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:04,400 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:14:04,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.94 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 945.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:04,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:04,402 INFO L168 Benchmark]: Boogie Preprocessor took 31.33 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 19:14:04,403 INFO L168 Benchmark]: RCFGBuilder took 543.24 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:04,404 INFO L168 Benchmark]: TraceAbstraction took 4142.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.4 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2020-07-28 19:14:04,408 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.94 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 945.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.33 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 543.24 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4142.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.4 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...