./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer --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 ce077c63676f801e14160b963d91b2f98c313404 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:00:57,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:00:57,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:00:57,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:00:57,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:00:57,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:00:57,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:00:57,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:00:57,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:00:57,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:00:57,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:00:57,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:00:57,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:00:57,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:00:57,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:00:57,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:00:57,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:00:57,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:00:57,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:00:57,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:00:57,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:00:57,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:00:57,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:00:57,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:00:57,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:00:57,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:00:57,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:00:57,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:00:57,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:00:57,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:00:57,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:00:57,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:00:57,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:00:57,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:00:57,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:00:57,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:00:57,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 06:00:57,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:00:57,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:00:57,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:00:57,103 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:00:57,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:00:57,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:00:57,103 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:00:57,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:00:57,104 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:00:57,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:00:57,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:00:57,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:00:57,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:00:57,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:00:57,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:00:57,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:00:57,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:00:57,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer 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 -> ce077c63676f801e14160b963d91b2f98c313404 [2018-11-23 06:00:57,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:00:57,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:00:57,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:00:57,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:00:57,138 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:00:57,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-23 06:00:57,176 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/data/113d97dcc/d361bfafcf2c45d386d23253bf44f064/FLAG0f6f85100 [2018-11-23 06:00:57,611 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:00:57,612 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-23 06:00:57,619 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/data/113d97dcc/d361bfafcf2c45d386d23253bf44f064/FLAG0f6f85100 [2018-11-23 06:00:57,631 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/data/113d97dcc/d361bfafcf2c45d386d23253bf44f064 [2018-11-23 06:00:57,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:00:57,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:00:57,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:00:57,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:00:57,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:00:57,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:00:57" (1/1) ... [2018-11-23 06:00:57,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335f4bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:57, skipping insertion in model container [2018-11-23 06:00:57,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:00:57" (1/1) ... [2018-11-23 06:00:57,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:00:57,681 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:00:57,885 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:00:57,892 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:00:57,972 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:00:58,003 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:00:58,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58 WrapperNode [2018-11-23 06:00:58,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:00:58,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:00:58,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:00:58,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:00:58,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:00:58,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:00:58,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:00:58,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:00:58,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... [2018-11-23 06:00:58,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:00:58,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:00:58,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:00:58,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:00:58,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/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 [2018-11-23 06:00:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:00:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:00:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 06:00:58,085 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 06:00:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:00:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:00:58,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:00:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:00:58,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:00:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 06:00:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 06:00:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:00:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:00:58,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:00:58,387 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:00:58,387 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:00:58,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:00:58 BoogieIcfgContainer [2018-11-23 06:00:58,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:00:58,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:00:58,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:00:58,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:00:58,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:00:57" (1/3) ... [2018-11-23 06:00:58,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10aa1348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:00:58, skipping insertion in model container [2018-11-23 06:00:58,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:00:58" (2/3) ... [2018-11-23 06:00:58,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10aa1348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:00:58, skipping insertion in model container [2018-11-23 06:00:58,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:00:58" (3/3) ... [2018-11-23 06:00:58,394 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-23 06:00:58,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:00:58,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:00:58,421 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:00:58,447 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:00:58,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:00:58,447 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:00:58,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:00:58,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:00:58,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:00:58,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:00:58,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:00:58,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:00:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-23 06:00:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 06:00:58,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:58,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:58,467 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:58,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 615932551, now seen corresponding path program 1 times [2018-11-23 06:00:58,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:58,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:58,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:00:58,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:00:58,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:00:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 06:00:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:00:58,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:00:58,571 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-23 06:00:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:58,586 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2018-11-23 06:00:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:00:58,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 06:00:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:58,591 INFO L225 Difference]: With dead ends: 108 [2018-11-23 06:00:58,592 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 06:00:58,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:00:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 06:00:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 06:00:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 06:00:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2018-11-23 06:00:58,617 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2018-11-23 06:00:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:58,617 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2018-11-23 06:00:58,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 06:00:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2018-11-23 06:00:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 06:00:58,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:58,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:58,619 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:58,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2054128225, now seen corresponding path program 1 times [2018-11-23 06:00:58,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:00:58,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:00:58,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:00:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:00:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:00:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:00:58,667 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 3 states. [2018-11-23 06:00:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:58,685 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-11-23 06:00:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:00:58,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 06:00:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:58,687 INFO L225 Difference]: With dead ends: 75 [2018-11-23 06:00:58,688 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 06:00:58,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:00:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 06:00:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 06:00:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 06:00:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2018-11-23 06:00:58,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2018-11-23 06:00:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:58,693 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2018-11-23 06:00:58,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:00:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2018-11-23 06:00:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 06:00:58,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:58,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:58,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:58,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash 623425772, now seen corresponding path program 1 times [2018-11-23 06:00:58,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:58,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:58,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:58,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:00:58,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:00:58,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:00:58,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:00:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:00:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:00:58,731 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 3 states. [2018-11-23 06:00:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:58,743 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2018-11-23 06:00:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:00:58,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 06:00:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:58,744 INFO L225 Difference]: With dead ends: 93 [2018-11-23 06:00:58,744 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 06:00:58,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:00:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 06:00:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 06:00:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 06:00:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2018-11-23 06:00:58,748 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2018-11-23 06:00:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:58,748 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2018-11-23 06:00:58,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:00:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-11-23 06:00:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 06:00:58,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:58,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:58,750 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:58,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash -194222678, now seen corresponding path program 1 times [2018-11-23 06:00:58,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:00:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:00:58,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:00:58,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:00:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:00:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:00:58,817 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 5 states. [2018-11-23 06:00:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:58,911 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2018-11-23 06:00:58,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:00:58,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 06:00:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:58,913 INFO L225 Difference]: With dead ends: 82 [2018-11-23 06:00:58,913 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 06:00:58,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:00:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 06:00:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2018-11-23 06:00:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 06:00:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 06:00:58,919 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2018-11-23 06:00:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:58,919 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 06:00:58,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:00:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 06:00:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 06:00:58,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:58,921 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:58,921 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:58,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1915719579, now seen corresponding path program 1 times [2018-11-23 06:00:58,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:58,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:58,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:58,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:00:58,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:00:58,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:00:58,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:00:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:00:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:00:58,999 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 5 states. [2018-11-23 06:00:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:59,088 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 06:00:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:00:59,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 06:00:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:59,089 INFO L225 Difference]: With dead ends: 84 [2018-11-23 06:00:59,089 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 06:00:59,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:00:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 06:00:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2018-11-23 06:00:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 06:00:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2018-11-23 06:00:59,094 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2018-11-23 06:00:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:59,094 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2018-11-23 06:00:59,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:00:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2018-11-23 06:00:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 06:00:59,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:59,095 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:59,095 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:59,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:59,096 INFO L82 PathProgramCache]: Analyzing trace with hash -891016603, now seen corresponding path program 1 times [2018-11-23 06:00:59,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:59,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:59,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:59,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:00:59,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:00:59,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:00:59,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:00:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:00:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:00:59,151 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 5 states. [2018-11-23 06:00:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:59,209 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 06:00:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:00:59,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 06:00:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:59,210 INFO L225 Difference]: With dead ends: 84 [2018-11-23 06:00:59,210 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 06:00:59,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:00:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 06:00:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-11-23 06:00:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 06:00:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2018-11-23 06:00:59,215 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2018-11-23 06:00:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:59,215 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2018-11-23 06:00:59,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:00:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2018-11-23 06:00:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 06:00:59,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:59,216 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:59,216 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:59,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1255728367, now seen corresponding path program 1 times [2018-11-23 06:00:59,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:59,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:00:59,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:00:59,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:00:59,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:59,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:00:59,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:00:59,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:00:59,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:00:59,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:00:59,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:00:59,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:00:59,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:00:59,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,459 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 06:00:59,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 06:00:59,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:00:59,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:00:59,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 06:00:59,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 06:00:59,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:00:59,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:00:59,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 06:00:59,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:00:59,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:00:59,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:00:59,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,550 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 06:00:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:00:59,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:00:59,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 06:00:59,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 06:00:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:00:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:00:59,574 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 10 states. [2018-11-23 06:00:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:00:59,747 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 06:00:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:00:59,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 06:00:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:00:59,748 INFO L225 Difference]: With dead ends: 90 [2018-11-23 06:00:59,748 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 06:00:59,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 06:00:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 06:00:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-11-23 06:00:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 06:00:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2018-11-23 06:00:59,754 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 35 [2018-11-23 06:00:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:00:59,755 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2018-11-23 06:00:59,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 06:00:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2018-11-23 06:00:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 06:00:59,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:00:59,756 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:00:59,756 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:00:59,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:00:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2119130031, now seen corresponding path program 1 times [2018-11-23 06:00:59,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:00:59,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:00:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:59,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:00:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:00:59,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:00:59,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:00:59,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:00:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:00:59,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:00:59,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:00:59,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:00:59,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:00:59,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:00:59,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:00:59,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:00:59,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:00:59,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:00:59,994 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 06:01:00,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 06:01:00,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:00,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:01:00,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 06:01:00,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 06:01:00,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:00,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:00,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 06:01:00,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:01:00,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:00,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:01:00,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 06:01:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:00,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:00,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 06:01:00,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 06:01:00,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:01:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:01:00,133 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 10 states. [2018-11-23 06:01:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:00,284 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 06:01:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:01:00,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 06:01:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:00,285 INFO L225 Difference]: With dead ends: 95 [2018-11-23 06:01:00,285 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 06:01:00,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 06:01:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 06:01:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-23 06:01:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 06:01:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2018-11-23 06:01:00,289 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2018-11-23 06:01:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:00,290 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2018-11-23 06:01:00,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 06:01:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2018-11-23 06:01:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:01:00,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:00,291 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:01:00,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:00,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:00,291 INFO L82 PathProgramCache]: Analyzing trace with hash 179529740, now seen corresponding path program 1 times [2018-11-23 06:01:00,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:00,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:00,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:00,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:01:00,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:00,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:00,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:00,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:00,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:00,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:01:00,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:00,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:00,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:01:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 06:01:00,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 06:01:00,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 06:01:00,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 06:01:00,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 06:01:00,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,515 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-11-23 06:01:00,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-11-23 06:01:00,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-23 06:01:00,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-11-23 06:01:00,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-23 06:01:00,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 06:01:00,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 06:01:00,559 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,563 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-11-23 06:01:00,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 06:01:00,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-11-23 06:01:00,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 06:01:00,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-23 06:01:00,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-11-23 06:01:00,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 06:01:00,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:00,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:00,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 06:01:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:00,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:00,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-11-23 06:01:00,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 06:01:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 06:01:00,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-23 06:01:00,627 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 15 states. [2018-11-23 06:01:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:00,954 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2018-11-23 06:01:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:01:00,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 06:01:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:00,955 INFO L225 Difference]: With dead ends: 99 [2018-11-23 06:01:00,955 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 06:01:00,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:01:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 06:01:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-11-23 06:01:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 06:01:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2018-11-23 06:01:00,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2018-11-23 06:01:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:00,960 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2018-11-23 06:01:00,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 06:01:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2018-11-23 06:01:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:01:00,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:00,961 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:01:00,961 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:00,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2060794632, now seen corresponding path program 2 times [2018-11-23 06:01:00,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:00,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:00,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:01,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:01,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:01,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:01:01,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:01:01,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:01:01,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:01,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:01,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:01:01,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:01:01,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:01,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:01,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-23 06:01:01,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 06:01:01,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:01:01,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 06:01:01,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 06:01:01,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:01,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-11-23 06:01:01,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 06:01:01,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:01:01,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:01,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-11-23 06:01:01,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-23 06:01:01,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 06:01:01,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 06:01:01,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-23 06:01:01,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:01,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 06:01:01,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 06:01:01,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 06:01:01,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-23 06:01:01,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:01:01,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:01,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:01:01,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:01,641 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-23 06:01:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 06:01:01,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 06:01:01,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 06:01:01,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 06:01:01,664 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 17 states. [2018-11-23 06:01:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:02,233 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2018-11-23 06:01:02,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 06:01:02,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-23 06:01:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:02,235 INFO L225 Difference]: With dead ends: 131 [2018-11-23 06:01:02,235 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 06:01:02,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 06:01:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 06:01:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 96. [2018-11-23 06:01:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 06:01:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2018-11-23 06:01:02,241 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 39 [2018-11-23 06:01:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:02,242 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2018-11-23 06:01:02,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 06:01:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2018-11-23 06:01:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:01:02,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:02,242 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-23 06:01:02,243 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:02,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash 778068551, now seen corresponding path program 2 times [2018-11-23 06:01:02,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:02,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:01:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:01:02,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:02,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:01:02,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:01:02,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:01:02,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:02,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:02,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:01:02,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:02,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:02,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:01:02,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 06:01:02,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:02,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:02,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:02,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:02,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2018-11-23 06:01:02,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-11-23 06:01:02,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-23 06:01:02,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 06:01:02,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 06:01:02,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-11-23 06:01:02,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-23 06:01:02,492 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,499 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:133, output treesize:33 [2018-11-23 06:01:02,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-23 06:01:02,512 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:01:02,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-23 06:01:02,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 06:01:02,537 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:01:02,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:01:02,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2018-11-23 06:01:02,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 06:01:02,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:02,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 06:01:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-11-23 06:01:02,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 06:01:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 06:01:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:01:02,580 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand 11 states. [2018-11-23 06:01:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:02,809 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2018-11-23 06:01:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:01:02,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-23 06:01:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:02,811 INFO L225 Difference]: With dead ends: 116 [2018-11-23 06:01:02,811 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 06:01:02,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-11-23 06:01:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 06:01:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2018-11-23 06:01:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 06:01:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2018-11-23 06:01:02,815 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 39 [2018-11-23 06:01:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:02,816 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2018-11-23 06:01:02,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 06:01:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2018-11-23 06:01:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:01:02,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:02,817 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-23 06:01:02,817 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:02,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1300146617, now seen corresponding path program 1 times [2018-11-23 06:01:02,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:02,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:02,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:01:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 06:01:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:02,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:02,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:02,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:02,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:01:02,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:02,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:02,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:01:02,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:02,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:02,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,926 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-23 06:01:02,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 06:01:02,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:02,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:01:02,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-23 06:01:02,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 06:01:02,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:02,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:02,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-23 06:01:02,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:01:02,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:02,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:01:02,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:02,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-23 06:01:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 06:01:02,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:02,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 06:01:02,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 06:01:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:01:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:01:02,999 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 10 states. [2018-11-23 06:01:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:03,149 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2018-11-23 06:01:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:01:03,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-23 06:01:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:03,150 INFO L225 Difference]: With dead ends: 114 [2018-11-23 06:01:03,150 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 06:01:03,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 06:01:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 06:01:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2018-11-23 06:01:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 06:01:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2018-11-23 06:01:03,155 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 39 [2018-11-23 06:01:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:03,156 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2018-11-23 06:01:03,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 06:01:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2018-11-23 06:01:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:01:03,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:03,156 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-23 06:01:03,156 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:03,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1599848569, now seen corresponding path program 1 times [2018-11-23 06:01:03,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:03,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:03,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:01:03,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:03,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:03,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:03,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:03,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:03,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 06:01:03,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:03,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:03,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:01:03,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-23 06:01:03,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 06:01:03,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 06:01:03,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 06:01:03,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 06:01:03,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2018-11-23 06:01:03,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 121 [2018-11-23 06:01:03,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-23 06:01:03,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2018-11-23 06:01:03,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-23 06:01:03,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 06:01:03,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 06:01:03,455 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,457 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,460 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-11-23 06:01:03,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 06:01:03,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-11-23 06:01:03,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 06:01:03,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-23 06:01:03,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2018-11-23 06:01:03,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 06:01:03,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:03,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 06:01:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:03,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:03,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-11-23 06:01:03,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 06:01:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 06:01:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-23 06:01:03,515 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand 15 states. [2018-11-23 06:01:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:03,790 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-11-23 06:01:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:01:03,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-11-23 06:01:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:03,791 INFO L225 Difference]: With dead ends: 111 [2018-11-23 06:01:03,791 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 06:01:03,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:01:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 06:01:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-11-23 06:01:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 06:01:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2018-11-23 06:01:03,796 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 39 [2018-11-23 06:01:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:03,796 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2018-11-23 06:01:03,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 06:01:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2018-11-23 06:01:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:01:03,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:03,797 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:01:03,797 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:03,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1071069048, now seen corresponding path program 2 times [2018-11-23 06:01:03,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:03,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:03,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:01:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:03,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:03,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:01:03,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:01:03,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:01:03,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:03,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:03,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:01:03,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:03,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:03,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 06:01:03,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:03,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:03,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,968 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-23 06:01:03,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 06:01:03,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:03,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:01:03,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:03,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 06:01:04,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 06:01:04,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:04,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2018-11-23 06:01:04,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 06:01:04,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:04,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 06:01:04,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:04,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-11-23 06:01:04,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:04,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-23 06:01:04,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 06:01:04,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-23 06:01:04,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:04,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-23 06:01:04,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 06:01:04,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 06:01:04,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 06:01:04,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-23 06:01:04,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 06:01:04,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 06:01:04,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 06:01:04,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,310 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-23 06:01:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 06:01:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 06:01:04,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 06:01:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 06:01:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 06:01:04,333 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 17 states. [2018-11-23 06:01:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:04,706 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-23 06:01:04,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 06:01:04,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-23 06:01:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:04,707 INFO L225 Difference]: With dead ends: 130 [2018-11-23 06:01:04,707 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 06:01:04,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 06:01:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 06:01:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2018-11-23 06:01:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 06:01:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2018-11-23 06:01:04,712 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 39 [2018-11-23 06:01:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:04,712 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-23 06:01:04,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 06:01:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 06:01:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 06:01:04,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:04,713 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:01:04,713 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:04,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash -395037645, now seen corresponding path program 3 times [2018-11-23 06:01:04,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:04,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:01:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:01:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:01:04,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:01:04,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:01:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:01:04,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:01:04,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:01:04,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:01:04,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 06:01:04,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 06:01:04,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:04,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:04,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 06:01:04,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-23 06:01:04,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:04,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:04,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:04,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 06:01:05,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 06:01:05,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-11-23 06:01:05,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 06:01:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-11-23 06:01:05,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 06:01:05,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-11-23 06:01:05,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-23 06:01:05,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-23 06:01:05,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 06:01:05,110 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,115 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,124 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:96, output treesize:63 [2018-11-23 06:01:05,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-11-23 06:01:05,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-23 06:01:05,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 127 [2018-11-23 06:01:05,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 06:01:05,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 100 [2018-11-23 06:01:05,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 06:01:05,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,223 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:169, output treesize:117 [2018-11-23 06:01:05,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 269 [2018-11-23 06:01:05,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 1 [2018-11-23 06:01:05,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 101 [2018-11-23 06:01:05,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-11-23 06:01:05,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 194 [2018-11-23 06:01:05,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 1 [2018-11-23 06:01:05,318 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,335 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:306, output treesize:96 [2018-11-23 06:01:05,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:01:05,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-11-23 06:01:05,390 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-11-23 06:01:05,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 06:01:05,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-23 06:01:05,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:05,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:05,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-23 06:01:05,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2018-11-23 06:01:05,422 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-23 06:01:05,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:01:05,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:01:05,439 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:114, output treesize:29 [2018-11-23 06:01:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:01:05,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:01:05,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-11-23 06:01:05,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 06:01:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 06:01:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:01:05,501 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 21 states. [2018-11-23 06:01:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:01:06,037 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2018-11-23 06:01:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 06:01:06,037 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-11-23 06:01:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:01:06,037 INFO L225 Difference]: With dead ends: 121 [2018-11-23 06:01:06,038 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 06:01:06,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 06:01:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 06:01:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-11-23 06:01:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 06:01:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-23 06:01:06,043 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 41 [2018-11-23 06:01:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:01:06,043 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-23 06:01:06,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 06:01:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2018-11-23 06:01:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 06:01:06,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:01:06,044 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:01:06,044 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:01:06,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:01:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1195348621, now seen corresponding path program 1 times [2018-11-23 06:01:06,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:01:06,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:01:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:06,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:01:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:01:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:01:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:01:06,076 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=14, |#NULL.offset|=9, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] RET #215#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret41 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); VAL [main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet3|=0] [?] assume !(0 != #t~nondet3);havoc #t~nondet3; VAL [main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; VAL [main_~n~0.base=0, main_~n~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem22.base|=0, |main_#t~mem22.offset|=0, |main_#t~short24|=false] [?] assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem22.base|=0, |main_#t~mem22.offset|=0, |main_#t~mem23.base|=0, |main_#t~mem23.offset|=0, |main_#t~short24|=false] [?] assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~root~0.base != 0 || ~root~0.offset != 0); VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0] [?] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~nondet30|=1] [?] assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~nondet30|=0] [?] assume !(0 != #t~nondet30);havoc #t~nondet30; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~nondet33|=1] [?] assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=10, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=10, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~nondet33|=0] [?] assume !(0 != #t~nondet33);havoc #t~nondet33; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=10, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem36|=1] [?] assume !(2 == #t~mem36);havoc #t~mem36; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem38|=1] [?] assume !!(1 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem38|=2] [?] assume !(1 == #t~mem38);havoc #t~mem38; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem40|=2] [?] assume 3 != #t~mem40;havoc #t~mem40; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] assume !false; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L541] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L541] ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; [L541] havoc ~n~0.base, ~n~0.offset; [L542] call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet3=0, ~root~0.base=17, ~root~0.offset=0] [L544-L562] assume !(0 != #t~nondet3); [L544] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L563] ~n~0.base, ~n~0.offset := 0, 0; [L564] havoc ~pred~0.base, ~pred~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=0, ~n~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L565-L583] assume !!(~root~0.base != 0 || ~root~0.offset != 0); [L566] ~pred~0.base, ~pred~0.offset := 0, 0; [L567] ~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4); [L568] #t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] assume !#t~short24; [L568] call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4); [L568] #t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~mem23.base=0, #t~mem23.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568-L574] assume !#t~short24; [L568] havoc #t~mem23.base, #t~mem23.offset; [L568] havoc #t~mem22.base, #t~mem22.offset; [L568] havoc #t~short24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L575-L581] assume !(~pred~0.base != 0 || ~pred~0.offset != 0); [L581] ~root~0.base, ~root~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L582] call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L565-L583] assume !(~root~0.base != 0 || ~root~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L584] call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8); [L584] ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L585] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L586] havoc ~t~0.base, ~t~0.offset; [L587] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~nondet30=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588-L594] assume !!(0 != #t~nondet30); [L588] havoc #t~nondet30; [L589] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L590] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8); [L590] ~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L591] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L592] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L593] call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L593] ~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset; [L593] havoc #t~mem32.base, #t~mem32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet30=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588-L594] assume !(0 != #t~nondet30); [L588] havoc #t~nondet30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet33=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595-L601] assume !!(0 != #t~nondet33); [L595] havoc #t~nondet33; [L596] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L597] call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8); [L597] ~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L598] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L599] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L600] call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L600] ~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset; [L600] havoc #t~mem35.base, #t~mem35.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~nondet33=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595-L601] assume !(0 != #t~nondet33); [L595] havoc #t~nondet33; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L602] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L603] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604] call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem36=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604-L605] assume !(2 == #t~mem36); [L604] havoc #t~mem36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !!(1 == #t~mem38); [L606] havoc #t~mem38; [L607] call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L607] ~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset; [L607] havoc #t~mem39.base, #t~mem39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !(1 == #t~mem38); [L606] havoc #t~mem38; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608] call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem40=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608-L609] assume 3 != #t~mem40; [L608] havoc #t~mem40; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L609] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L541] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L541] ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; [L541] havoc ~n~0.base, ~n~0.offset; [L542] call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet3=0, ~root~0.base=17, ~root~0.offset=0] [L544-L562] assume !(0 != #t~nondet3); [L544] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L563] ~n~0.base, ~n~0.offset := 0, 0; [L564] havoc ~pred~0.base, ~pred~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=0, ~n~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L565-L583] assume !!(~root~0.base != 0 || ~root~0.offset != 0); [L566] ~pred~0.base, ~pred~0.offset := 0, 0; [L567] ~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4); [L568] #t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] assume !#t~short24; [L568] call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4); [L568] #t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~mem23.base=0, #t~mem23.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568-L574] assume !#t~short24; [L568] havoc #t~mem23.base, #t~mem23.offset; [L568] havoc #t~mem22.base, #t~mem22.offset; [L568] havoc #t~short24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L575-L581] assume !(~pred~0.base != 0 || ~pred~0.offset != 0); [L581] ~root~0.base, ~root~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L582] call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L565-L583] assume !(~root~0.base != 0 || ~root~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L584] call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8); [L584] ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L585] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L586] havoc ~t~0.base, ~t~0.offset; [L587] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~nondet30=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588-L594] assume !!(0 != #t~nondet30); [L588] havoc #t~nondet30; [L589] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L590] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8); [L590] ~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L591] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L592] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L593] call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L593] ~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset; [L593] havoc #t~mem32.base, #t~mem32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet30=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588-L594] assume !(0 != #t~nondet30); [L588] havoc #t~nondet30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet33=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595-L601] assume !!(0 != #t~nondet33); [L595] havoc #t~nondet33; [L596] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L597] call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8); [L597] ~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L598] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L599] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L600] call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L600] ~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset; [L600] havoc #t~mem35.base, #t~mem35.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~nondet33=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595-L601] assume !(0 != #t~nondet33); [L595] havoc #t~nondet33; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L602] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L603] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604] call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem36=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604-L605] assume !(2 == #t~mem36); [L604] havoc #t~mem36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !!(1 == #t~mem38); [L606] havoc #t~mem38; [L607] call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L607] ~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset; [L607] havoc #t~mem39.base, #t~mem39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !(1 == #t~mem38); [L606] havoc #t~mem38; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608] call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem40=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608-L609] assume 3 != #t~mem40; [L608] havoc #t~mem40; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L609] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, root={17:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={17:0}, n={0:0}, root={17:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={17:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={17:0}, n={17:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={17:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L591] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L598] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={10:0}] [L604] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] ----- [2018-11-23 06:01:06,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:01:06 BoogieIcfgContainer [2018-11-23 06:01:06,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:01:06,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:01:06,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:01:06,282 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:01:06,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:00:58" (3/4) ... [2018-11-23 06:01:06,284 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=14, |#NULL.offset|=9, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=14, |old(#NULL.offset)|=9] [?] RET #215#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret41 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4);call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); VAL [main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet3|=0] [?] assume !(0 != #t~nondet3);havoc #t~nondet3; VAL [main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; VAL [main_~n~0.base=0, main_~n~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem22.base|=0, |main_#t~mem22.offset|=0, |main_#t~short24|=false] [?] assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem22.base|=0, |main_#t~mem22.offset|=0, |main_#t~mem23.base|=0, |main_#t~mem23.offset|=0, |main_#t~short24|=false] [?] assume !#t~short24;havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=17, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~root~0.base != 0 || ~root~0.offset != 0); VAL [main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0] [?] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~nondet30|=1] [?] assume !!(0 != #t~nondet30);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~nondet30|=0] [?] assume !(0 != #t~nondet30);havoc #t~nondet30; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0] [?] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~nondet33|=1] [?] assume !!(0 != #t~nondet33);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=10, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=10, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~nondet33|=0] [?] assume !(0 != #t~nondet33);havoc #t~nondet33; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=10, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem36|=1] [?] assume !(2 == #t~mem36);havoc #t~mem36; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=18, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem38|=1] [?] assume !!(1 == #t~mem38);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem38|=2] [?] assume !(1 == #t~mem38);havoc #t~mem38; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0, |main_#t~mem40|=2] [?] assume 3 != #t~mem40;havoc #t~mem40; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] assume !false; VAL [main_~a~0.base=18, main_~a~0.offset=0, main_~n~0.base=17, main_~n~0.offset=0, main_~pred~0.base=0, main_~pred~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~root~0.base=0, main_~root~0.offset=0, main_~t~0.base=10, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~malloc29.base|=18, |main_#t~malloc29.offset|=0, |main_#t~malloc31.base|=20, |main_#t~malloc31.offset|=0, |main_#t~malloc34.base|=10, |main_#t~malloc34.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L541] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L541] ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; [L541] havoc ~n~0.base, ~n~0.offset; [L542] call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet3=0, ~root~0.base=17, ~root~0.offset=0] [L544-L562] assume !(0 != #t~nondet3); [L544] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L563] ~n~0.base, ~n~0.offset := 0, 0; [L564] havoc ~pred~0.base, ~pred~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=0, ~n~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L565-L583] assume !!(~root~0.base != 0 || ~root~0.offset != 0); [L566] ~pred~0.base, ~pred~0.offset := 0, 0; [L567] ~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4); [L568] #t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] assume !#t~short24; [L568] call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4); [L568] #t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~mem23.base=0, #t~mem23.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568-L574] assume !#t~short24; [L568] havoc #t~mem23.base, #t~mem23.offset; [L568] havoc #t~mem22.base, #t~mem22.offset; [L568] havoc #t~short24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L575-L581] assume !(~pred~0.base != 0 || ~pred~0.offset != 0); [L581] ~root~0.base, ~root~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L582] call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L565-L583] assume !(~root~0.base != 0 || ~root~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L584] call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8); [L584] ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L585] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L586] havoc ~t~0.base, ~t~0.offset; [L587] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~nondet30=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588-L594] assume !!(0 != #t~nondet30); [L588] havoc #t~nondet30; [L589] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L590] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8); [L590] ~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L591] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L592] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L593] call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L593] ~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset; [L593] havoc #t~mem32.base, #t~mem32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet30=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588-L594] assume !(0 != #t~nondet30); [L588] havoc #t~nondet30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet33=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595-L601] assume !!(0 != #t~nondet33); [L595] havoc #t~nondet33; [L596] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L597] call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8); [L597] ~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L598] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L599] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L600] call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L600] ~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset; [L600] havoc #t~mem35.base, #t~mem35.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~nondet33=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595-L601] assume !(0 != #t~nondet33); [L595] havoc #t~nondet33; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L602] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L603] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604] call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem36=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604-L605] assume !(2 == #t~mem36); [L604] havoc #t~mem36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !!(1 == #t~mem38); [L606] havoc #t~mem38; [L607] call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L607] ~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset; [L607] havoc #t~mem39.base, #t~mem39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !(1 == #t~mem38); [L606] havoc #t~mem38; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608] call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem40=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608-L609] assume 3 != #t~mem40; [L608] havoc #t~mem40; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L609] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=14, #NULL.offset=9, old(#NULL.base)=14, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=14, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L541] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L541] ~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset; [L541] havoc ~n~0.base, ~n~0.offset; [L542] call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset, 4); [L543] call write~$Pointer$(0, 0, ~root~0.base, 4 + ~root~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet3=0, ~root~0.base=17, ~root~0.offset=0] [L544-L562] assume !(0 != #t~nondet3); [L544] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~root~0.base=17, ~root~0.offset=0] [L563] ~n~0.base, ~n~0.offset := 0, 0; [L564] havoc ~pred~0.base, ~pred~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=0, ~n~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L565-L583] assume !!(~root~0.base != 0 || ~root~0.offset != 0); [L566] ~pred~0.base, ~pred~0.offset := 0, 0; [L567] ~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset, 4); [L568] #t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568] assume !#t~short24; [L568] call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, 4 + ~n~0.offset, 4); [L568] #t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem22.base=0, #t~mem22.offset=0, #t~mem23.base=0, #t~mem23.offset=0, #t~short24=false, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L568-L574] assume !#t~short24; [L568] havoc #t~mem23.base, #t~mem23.offset; [L568] havoc #t~mem22.base, #t~mem22.offset; [L568] havoc #t~short24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=17, ~root~0.offset=0] [L575-L581] assume !(~pred~0.base != 0 || ~pred~0.offset != 0); [L581] ~root~0.base, ~root~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L582] call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L565-L583] assume !(~root~0.base != 0 || ~root~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L584] call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8); [L584] ~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L585] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L586] havoc ~t~0.base, ~t~0.offset; [L587] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~nondet30=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0] [L588-L594] assume !!(0 != #t~nondet30); [L588] havoc #t~nondet30; [L589] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L590] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8); [L590] ~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L591] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L592] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L593] call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L593] ~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset; [L593] havoc #t~mem32.base, #t~mem32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet30=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L588-L594] assume !(0 != #t~nondet30); [L588] havoc #t~nondet30; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~nondet33=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L595-L601] assume !!(0 != #t~nondet33); [L595] havoc #t~nondet33; [L596] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L597] call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8); [L597] ~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L598] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L599] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L600] call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L600] ~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset; [L600] havoc #t~mem35.base, #t~mem35.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~nondet33=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L595-L601] assume !(0 != #t~nondet33); [L595] havoc #t~nondet33; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=10, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L602] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L603] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604] call #t~mem36 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem36=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L604-L605] assume !(2 == #t~mem36); [L604] havoc #t~mem36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=1, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=18, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !!(1 == #t~mem38); [L606] havoc #t~mem38; [L607] call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L607] ~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset; [L607] havoc #t~mem39.base, #t~mem39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606] call #t~mem38 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem38=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L606-L607] assume !(1 == #t~mem38); [L606] havoc #t~mem38; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608] call #t~mem40 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, #t~mem40=2, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L608-L609] assume 3 != #t~mem40; [L608] havoc #t~mem40; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [L609] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~malloc29.base=18, #t~malloc29.offset=0, #t~malloc31.base=20, #t~malloc31.offset=0, #t~malloc34.base=10, #t~malloc34.offset=0, ~a~0.base=18, ~a~0.offset=0, ~n~0.base=17, ~n~0.offset=0, ~pred~0.base=0, ~pred~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~root~0.base=0, ~root~0.offset=0, ~t~0.base=10, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=14, #NULL!offset=9, old(#NULL!base)=14, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=14, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret41 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L541] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L541] ~root~0 := #t~malloc2; [L541] havoc ~n~0; [L542] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L543] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L544] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet3=0, ~root~0!base=17, ~root~0!offset=0] [L544-L562] COND TRUE !(0 != #t~nondet3) [L544] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~root~0!base=17, ~root~0!offset=0] [L563] ~n~0 := { base: 0, offset: 0 }; [L564] havoc ~pred~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=0, ~n~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L565-L583] COND FALSE !(!(~root~0 != { base: 0, offset: 0 })) [L566] ~pred~0 := { base: 0, offset: 0 }; [L567] ~n~0 := ~root~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] FCALL call #t~mem22 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L568] #t~short24 := #t~mem22 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568] COND FALSE !(#t~short24) [L568] FCALL call #t~mem23 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L568] #t~short24 := #t~mem23 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem22!base=0, #t~mem22!offset=0, #t~mem23!base=0, #t~mem23!offset=0, #t~short24=false, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L568-L574] COND TRUE !#t~short24 [L568] havoc #t~mem23; [L568] havoc #t~mem22; [L568] havoc #t~short24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=17, ~root~0!offset=0] [L575-L581] COND FALSE !(~pred~0 != { base: 0, offset: 0 }) [L581] ~root~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L582] FCALL call ULTIMATE.dealloc(~n~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L565-L583] COND TRUE !(~root~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L584] FCALL call #t~malloc29 := #Ultimate.alloc(8); [L584] ~a~0 := #t~malloc29; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L585] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L586] havoc ~t~0; [L587] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~nondet30=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0] [L588-L594] COND FALSE !(!(0 != #t~nondet30)) [L588] havoc #t~nondet30; [L589] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L590] FCALL call #t~malloc31 := #Ultimate.alloc(8); [L590] ~t~0 := #t~malloc31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L591] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L592] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] FCALL call #t~mem32 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L593] ~p~0 := #t~mem32; [L593] havoc #t~mem32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588] assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet30=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L588-L594] COND TRUE !(0 != #t~nondet30) [L588] havoc #t~nondet30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~nondet33=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L595-L601] COND FALSE !(!(0 != #t~nondet33)) [L595] havoc #t~nondet33; [L596] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L597] FCALL call #t~malloc34 := #Ultimate.alloc(8); [L597] ~t~0 := #t~malloc34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L598] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L599] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] FCALL call #t~mem35 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L600] ~p~0 := #t~mem35; [L600] havoc #t~mem35; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595] assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~nondet33=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L595-L601] COND TRUE !(0 != #t~nondet33) [L595] havoc #t~nondet33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=10, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L602] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L603] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604] FCALL call #t~mem36 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem36=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L604-L605] COND TRUE !(2 == #t~mem36) [L604] havoc #t~mem36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=1, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=18, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND FALSE !(!(1 == #t~mem38)) [L606] havoc #t~mem38; [L607] FCALL call #t~mem39 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L607] ~p~0 := #t~mem39; [L607] havoc #t~mem39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606] FCALL call #t~mem38 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem38=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L606-L607] COND TRUE !(1 == #t~mem38) [L606] havoc #t~mem38; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] FCALL call #t~mem40 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, #t~mem40=2, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L608] COND TRUE 3 != #t~mem40 [L608] havoc #t~mem40; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L609] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~malloc29!base=18, #t~malloc29!offset=0, #t~malloc31!base=20, #t~malloc31!offset=0, #t~malloc34!base=10, #t~malloc34!offset=0, ~a~0!base=18, ~a~0!offset=0, ~n~0!base=17, ~n~0!offset=0, ~pred~0!base=0, ~pred~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~root~0!base=0, ~root~0!offset=0, ~t~0!base=10, ~t~0!offset=0] [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, root={17:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={17:0}, n={0:0}, root={17:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={17:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={17:0}, n={17:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={17:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L591] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L598] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={10:0}] [L604] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] ----- [2018-11-23 06:01:06,685 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_27346fae-3563-4334-994a-e53601fae3e4/bin-2019/uautomizer/witness.graphml [2018-11-23 06:01:06,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:01:06,686 INFO L168 Benchmark]: Toolchain (without parser) took 9052.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 955.5 MB in the beginning and 961.8 MB in the end (delta: -6.3 MB). Peak memory consumption was 216.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,687 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:01:06,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.97 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: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,688 INFO L168 Benchmark]: Boogie Preprocessor took 27.26 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,688 INFO L168 Benchmark]: RCFGBuilder took 335.46 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,688 INFO L168 Benchmark]: TraceAbstraction took 7893.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 113.1 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,688 INFO L168 Benchmark]: Witness Printer took 403.37 ms. Allocated memory is still 1.3 GB. Free memory was 975.4 MB in the beginning and 961.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:01:06,691 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.97 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: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.26 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.46 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: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7893.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 975.4 MB in the end (delta: 113.1 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB. * Witness Printer took 403.37 ms. Allocated memory is still 1.3 GB. Free memory was 975.4 MB in the beginning and 961.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, root={17:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={17:0}, n={0:0}, root={17:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={17:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={17:0}, n={17:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={17:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={17:0}, n={17:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L591] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={20:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L598] COND FALSE !(t == 0) VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, pred={0:0}, root={0:0}, t={10:0}] [L604] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={18:0}, p->h=1, pred={0:0}, root={0:0}, t={10:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, p->h=2, pred={0:0}, root={0:0}, t={10:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={18:0}, malloc(sizeof(*root))={17:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={18:0}, malloc(sizeof(struct node))={20:0}, n={17:0}, p={20:0}, pred={0:0}, root={0:0}, t={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 1 error locations. UNSAFE Result, 7.8s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 890 SDtfs, 1001 SDslu, 3852 SDs, 0 SdLazy, 2423 SolverSat, 363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 299 SyntacticMatches, 34 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 182 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 835 ConstructedInterpolants, 25 QuantifiedInterpolants, 270009 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1525 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 49/142 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...