./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-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_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9eff01e8b41fd58fd007a4a54a96fca4ce69974c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:57:56,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:57:56,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:57:56,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:57:56,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:57:56,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:57:56,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:57:56,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:57:56,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:57:56,677 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:57:56,677 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:57:56,677 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:57:56,678 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:57:56,679 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:57:56,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:57:56,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:57:56,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:57:56,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:57:56,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:57:56,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:57:56,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:57:56,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:57:56,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:57:56,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:57:56,687 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:57:56,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:57:56,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:57:56,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:57:56,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:57:56,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:57:56,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:57:56,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:57:56,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:57:56,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:57:56,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:57:56,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:57:56,693 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:57:56,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:57:56,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:57:56,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:57:56,704 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:57:56,704 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:57:56,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:57:56,704 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:57:56,705 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:57:56,705 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:57:56,705 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:57:56,705 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:57:56,705 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:57:56,705 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:57:56,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:57:56,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:57:56,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:57:56,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:57:56,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:57:56,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan 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 -> Taipan 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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-11-23 02:57:56,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:57:56,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:57:56,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:57:56,742 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:57:56,742 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:57:56,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 02:57:56,778 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/data/ae634f2f7/c03a3936709742399f3d6bd80da9a873/FLAGd54fad384 [2018-11-23 02:57:57,182 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:57:57,182 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 02:57:57,186 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/data/ae634f2f7/c03a3936709742399f3d6bd80da9a873/FLAGd54fad384 [2018-11-23 02:57:57,195 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/data/ae634f2f7/c03a3936709742399f3d6bd80da9a873 [2018-11-23 02:57:57,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:57:57,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:57:57,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:57:57,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:57:57,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:57:57,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ddd63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57, skipping insertion in model container [2018-11-23 02:57:57,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:57:57,224 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:57:57,332 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:57:57,334 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:57:57,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:57:57,361 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:57:57,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57 WrapperNode [2018-11-23 02:57:57,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:57:57,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:57:57,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:57:57,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:57:57,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:57:57,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:57:57,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:57:57,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:57:57,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... [2018-11-23 02:57:57,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:57:57,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:57:57,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:57:57,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:57:57,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/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 02:57:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:57:57,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:57:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:57:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:57:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:57:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:57:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:57:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:57:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:57:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:57:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:57:57,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:57:57,591 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:57:57,591 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 02:57:57,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:57 BoogieIcfgContainer [2018-11-23 02:57:57,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:57:57,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:57:57,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:57:57,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:57:57,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:57:57" (1/3) ... [2018-11-23 02:57:57,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e00ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:57, skipping insertion in model container [2018-11-23 02:57:57,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:57" (2/3) ... [2018-11-23 02:57:57,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e00ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:57, skipping insertion in model container [2018-11-23 02:57:57,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:57" (3/3) ... [2018-11-23 02:57:57,597 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-23 02:57:57,605 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:57:57,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:57:57,623 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:57:57,650 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:57:57,651 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:57:57,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:57:57,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:57:57,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:57:57,651 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:57:57,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:57:57,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:57:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 02:57:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:57:57,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:57,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:57,674 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:57,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 02:57:57,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:57:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:57,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:57,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:57:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:57,772 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 02:57:57,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:57,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:57:57,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:57:57,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:57:57,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:57:57,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:57:57,790 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 02:57:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:57,805 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 02:57:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:57:57,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 02:57:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:57,812 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:57:57,812 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 02:57:57,816 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 02:57:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 02:57:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 02:57:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 02:57:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 02:57:57,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 02:57:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 02:57:57,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:57:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 02:57:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:57:57,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:57,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:57,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:57,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 02:57:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:57:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:57,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:57,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:57:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:57,929 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 02:57:57,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:57,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:57:57,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:57:57,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:57:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:57:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:57:57,932 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 02:57:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:57,989 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 02:57:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:57:57,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 02:57:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:57,991 INFO L225 Difference]: With dead ends: 36 [2018-11-23 02:57:57,991 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 02:57:57,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:57:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 02:57:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 02:57:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 02:57:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 02:57:57,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 02:57:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:57,995 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 02:57:57,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:57:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 02:57:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 02:57:57,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:57,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:57,996 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:57,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-11-23 02:57:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:57:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:57,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:57,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:57:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:58,054 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 02:57:58,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:58,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:57:58,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:57:58,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:57:58,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:57:58,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:57:58,059 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 02:57:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:58,115 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 02:57:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:57:58,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 02:57:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:58,118 INFO L225 Difference]: With dead ends: 44 [2018-11-23 02:57:58,118 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 02:57:58,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:57:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 02:57:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 02:57:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 02:57:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 02:57:58,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 02:57:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:58,126 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 02:57:58,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:57:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 02:57:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:57:58,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:58,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:58,127 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:58,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-23 02:57:58,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:57:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:58,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:58,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:57:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:57:58,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:57:58,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:57:58,469 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-23 02:57:58,470 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [25], [27], [29], [33], [41], [51], [54], [56], [62], [63], [64], [66] [2018-11-23 02:57:58,494 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:57:58,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:57:58,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:57:58,671 INFO L272 AbstractInterpreter]: Visited 19 different actions 43 times. Merged at 6 different actions 18 times. Widened at 2 different actions 2 times. Performed 262 root evaluator evaluations with a maximum evaluation depth of 4. Performed 262 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 4 different actions. Largest state had 26 variables. [2018-11-23 02:57:58,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:58,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:57:58,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:57:58,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/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 02:57:58,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:58,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:57:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:58,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:58,736 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 5 treesize of output 1 [2018-11-23 02:57:58,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 02:57:58,809 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 15 treesize of output 17 [2018-11-23 02:57:58,811 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 11 [2018-11-23 02:57:58,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 02:57:58,879 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 28 treesize of output 24 [2018-11-23 02:57:58,881 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:57:58,882 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 15 treesize of output 11 [2018-11-23 02:57:58,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,889 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 02:57:58,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:58,899 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 02:57:58,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-23 02:57:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:57:58,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:57:58,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-11-23 02:57:58,996 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 02:57:58,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,007 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-23 02:57:59,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:57:59,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:57:59,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-11-23 02:57:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:57:59,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:57:59,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 27 [2018-11-23 02:57:59,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:57:59,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 02:57:59,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:57:59,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-11-23 02:57:59,120 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 20 states. [2018-11-23 02:57:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:59,560 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 02:57:59,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 02:57:59,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-11-23 02:57:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:59,565 INFO L225 Difference]: With dead ends: 57 [2018-11-23 02:57:59,565 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 02:57:59,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1141, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 02:57:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 02:57:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2018-11-23 02:57:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 02:57:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 02:57:59,571 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 19 [2018-11-23 02:57:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:59,571 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 02:57:59,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 02:57:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 02:57:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:57:59,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:59,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:59,572 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:59,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2018-11-23 02:57:59,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:57:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:59,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:57:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:57:59,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:57:59,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:57:59,804 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:57:59,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:57:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:57:59,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/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 02:57:59,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:57:59,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:57:59,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:57:59,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:57:59,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:59,843 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 5 treesize of output 1 [2018-11-23 02:57:59,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 02:57:59,960 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 17 treesize of output 19 [2018-11-23 02:57:59,961 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 14 treesize of output 13 [2018-11-23 02:57:59,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:57:59,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-23 02:58:00,019 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 26 treesize of output 22 [2018-11-23 02:58:00,021 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 13 treesize of output 5 [2018-11-23 02:58:00,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:00,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:58:00,026 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 11 treesize of output 7 [2018-11-23 02:58:00,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:00,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:00,033 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 02:58:00,033 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2018-11-23 02:58:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:58:00,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:58:00,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-11-23 02:58:00,117 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 02:58:00,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:00,125 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-23 02:58:00,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:00,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:58:00,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:58:00,142 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-11-23 02:58:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:58:00,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:58:00,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 34 [2018-11-23 02:58:00,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:58:00,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 02:58:00,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 02:58:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 02:58:00,362 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 23 states. [2018-11-23 02:58:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:00,970 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-23 02:58:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 02:58:00,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-23 02:58:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:00,972 INFO L225 Difference]: With dead ends: 99 [2018-11-23 02:58:00,972 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 02:58:00,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=398, Invalid=2254, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 02:58:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 02:58:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-23 02:58:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 02:58:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-23 02:58:00,983 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 23 [2018-11-23 02:58:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:00,983 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-23 02:58:00,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 02:58:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 02:58:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:58:00,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:00,984 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] [2018-11-23 02:58:00,985 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:00,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -96694823, now seen corresponding path program 1 times [2018-11-23 02:58:00,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:58:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:00,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:58:00,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:00,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:58:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:58:01,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:58:01,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:58:01,046 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-23 02:58:01,046 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [25], [27], [29], [33], [41], [43], [45], [51], [54], [56], [59], [61], [62], [63], [64], [66], [67] [2018-11-23 02:58:01,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:58:01,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:58:01,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:58:01,143 INFO L272 AbstractInterpreter]: Visited 24 different actions 77 times. Merged at 10 different actions 29 times. Widened at 2 different actions 2 times. Performed 398 root evaluator evaluations with a maximum evaluation depth of 4. Performed 398 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 5 different actions. Largest state had 28 variables. [2018-11-23 02:58:01,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:01,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:58:01,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:58:01,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/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 02:58:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:01,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:58:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:01,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:58:01,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:58:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:58:01,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:58:01,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-23 02:58:01,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:58:01,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:58:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:58:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:58:01,289 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 11 states. [2018-11-23 02:58:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:01,409 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-23 02:58:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:58:01,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 02:58:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:01,410 INFO L225 Difference]: With dead ends: 82 [2018-11-23 02:58:01,410 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 02:58:01,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:58:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 02:58:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-11-23 02:58:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 02:58:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 02:58:01,417 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 27 [2018-11-23 02:58:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:01,417 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 02:58:01,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:58:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 02:58:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:58:01,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:01,418 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:01,418 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:01,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2018-11-23 02:58:01,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:58:01,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:01,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:58:01,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:01,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:58:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:58:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:58:01,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:58:01,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:58:01,680 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:58:01,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:58:01,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:58:01,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b0d9b70-d8f5-438f-8cf6-f969fecf7568/bin-2019/utaipan/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 02:58:01,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:58:01,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:58:01,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:58:01,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:58:01,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:58:01,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2018-11-23 02:58:01,763 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 19 treesize of output 18 [2018-11-23 02:58:01,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 02:58:01,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-23 02:58:01,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:58:01,819 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 30 treesize of output 39 [2018-11-23 02:58:01,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-23 02:58:01,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2018-11-23 02:58:01,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:58:01,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:58:01,929 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:58:01,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-11-23 02:58:01,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,940 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 15 treesize of output 8 [2018-11-23 02:58:01,940 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:58:01,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:58:01,950 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:58:01,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-23 02:58:01,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:01,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2018-11-23 02:58:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 02:58:01,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:58:02,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2018-11-23 02:58:02,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-23 02:58:02,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-23 02:58:02,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:02,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:02,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-23 02:58:02,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-23 02:58:02,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:58:02,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:58:02,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:58:02,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:58:02,233 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2018-11-23 02:58:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 02:58:02,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:58:02,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 38 [2018-11-23 02:58:02,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:58:02,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 02:58:02,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 02:58:02,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 02:58:02,338 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 27 states. [2018-11-23 02:58:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:58:03,654 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-11-23 02:58:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 02:58:03,654 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-11-23 02:58:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:58:03,655 INFO L225 Difference]: With dead ends: 87 [2018-11-23 02:58:03,655 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 02:58:03,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=771, Invalid=3519, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 02:58:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 02:58:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2018-11-23 02:58:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 02:58:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-23 02:58:03,666 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 27 [2018-11-23 02:58:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:58:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-23 02:58:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 02:58:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-23 02:58:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 02:58:03,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:58:03,667 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:58:03,667 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:58:03,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:58:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 2 times [2018-11-23 02:58:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:58:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:03,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:58:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:58:03,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:58:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:58:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:58:03,715 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6, |#NULL.offset|=3, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~cont~0=0, main_~i~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~cont~0=0, main_~i~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~cont~0=0, main_~i~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~cont~0=0, main_~i~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 < ~MAX~0); VAL [main_~cont~0=0, main_~i~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 >= 0); VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] ~j~0 := ~MAX~0 - 1;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #67#return; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int MAX = __VERIFIER_nondet_uint(); [L14] char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L18] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 >= 0); VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] ~j~0 := ~MAX~0 - 1;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #67#return; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] havoc #t~mem7;havoc #t~mem8;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem7; [L32] havoc #t~mem8; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int MAX = __VERIFIER_nondet_uint(); [L14] char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L18] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i