./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum_array_false-unreach-call.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_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/sum_array_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d03898b2adab3b021eca92ab7fbddac81b7b0464 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:45:02,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:45:02,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:45:02,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:45:02,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:45:02,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:45:02,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:45:02,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:45:02,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:45:02,995 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:45:02,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:45:02,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:45:02,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:45:02,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:45:02,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:45:02,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:45:02,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:45:02,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:45:03,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:45:03,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:45:03,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:45:03,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:45:03,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:45:03,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:45:03,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:45:03,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:45:03,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:45:03,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:45:03,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:45:03,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:45:03,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:45:03,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:45:03,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:45:03,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:45:03,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:45:03,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:45:03,009 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 03:45:03,016 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:45:03,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:45:03,017 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:45:03,017 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:45:03,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:45:03,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:45:03,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:45:03,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:45:03,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:45:03,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:45:03,019 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:45:03,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:45:03,020 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:45:03,020 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:45:03,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:45:03,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:45:03,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:45:03,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:45:03,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:45:03,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:45:03,021 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 03:45:03,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:45:03,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:45:03,021 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak 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 -> Kojak 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 -> d03898b2adab3b021eca92ab7fbddac81b7b0464 [2018-11-23 03:45:03,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:45:03,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:45:03,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:45:03,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:45:03,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:45:03,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/../../sv-benchmarks/c/loops/sum_array_false-unreach-call.i [2018-11-23 03:45:03,104 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/data/9f97f15ef/249f34cccd7b4136871c19ad676495ca/FLAG11b9f0e84 [2018-11-23 03:45:03,433 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:45:03,434 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/sv-benchmarks/c/loops/sum_array_false-unreach-call.i [2018-11-23 03:45:03,438 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/data/9f97f15ef/249f34cccd7b4136871c19ad676495ca/FLAG11b9f0e84 [2018-11-23 03:45:03,865 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/data/9f97f15ef/249f34cccd7b4136871c19ad676495ca [2018-11-23 03:45:03,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:45:03,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:45:03,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:45:03,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:45:03,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:45:03,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:03" (1/1) ... [2018-11-23 03:45:03,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5c9f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:03, skipping insertion in model container [2018-11-23 03:45:03,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:03" (1/1) ... [2018-11-23 03:45:03,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:45:03,893 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:45:04,005 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:45:04,008 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:45:04,024 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:45:04,035 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:45:04,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04 WrapperNode [2018-11-23 03:45:04,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:45:04,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:45:04,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:45:04,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:45:04,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:45:04,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:45:04,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:45:04,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:45:04,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:45:04,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:45:04,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:45:04,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:45:04,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f90bdf3-1425-402c-9292-73b7c14d3e4f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 03:45:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:45:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:45:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:45:04,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:45:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:45:04,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:45:04,376 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:45:04,376 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 03:45:04,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:04 BoogieIcfgContainer [2018-11-23 03:45:04,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:45:04,377 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:45:04,377 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:45:04,388 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:45:04,389 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:04" (1/1) ... [2018-11-23 03:45:04,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:45:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 10 states and 14 transitions. [2018-11-23 03:45:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2018-11-23 03:45:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 03:45:04,437 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:45:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:04,593 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 03:45:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:45:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 14 states and 20 transitions. [2018-11-23 03:45:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2018-11-23 03:45:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 03:45:04,685 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:45:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:45:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:45:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 15 states and 20 transitions. [2018-11-23 03:45:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2018-11-23 03:45:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 03:45:04,946 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:45:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:05,073 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 03:45:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:45:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 16 states and 21 transitions. [2018-11-23 03:45:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2018-11-23 03:45:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:45:05,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:45:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:45:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:45:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:45:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:45:05,272 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 4 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem11, main_#t~mem9, main_#t~mem10, main_#t~post8, main_~M~0, main_~#A~0.base, main_~#A~0.offset, main_~#B~0.base, main_~#B~0.offset, main_~#C~0.base, main_~#C~0.offset, main_~i~0;main_~M~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296));call main_~#B~0.base, main_~#B~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296));call main_~#C~0.base, main_~#C~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;call write~int(main_#t~nondet2, main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc main_#t~nondet2;main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);}EndParallelCompositionmain_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;call write~int(main_#t~nondet4, main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc main_#t~nondet4;main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);}EndParallelCompositionmain_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);call main_#t~mem6 := read~int(main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call main_#t~mem7 := read~int(main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(main_#t~mem6 + main_#t~mem7, main_~#C~0.base, main_~#C~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc main_#t~mem7;havoc main_#t~mem6;main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);}EndParallelCompositionmain_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296);call main_#t~mem11 := read~int(main_~#C~0.base, main_~#C~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call main_#t~mem9 := read~int(main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call main_#t~mem10 := read~int(main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4);__VERIFIER_assert_#in~cond := (if main_#t~mem11 == main_#t~mem9 - main_#t~mem10 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem10|=(- 2147477156), |ULTIMATE.start_main_#t~mem11|=(- 4294954602), |ULTIMATE.start_main_#t~mem9|=(- 2147477446), |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem10|=(- 2147477156), |ULTIMATE.start_main_#t~mem11|=(- 4294954602), |ULTIMATE.start_main_#t~mem9|=(- 2147477446), |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~M~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem10|=(- 2147477156), |ULTIMATE.start_main_#t~mem11|=(- 4294954602), |ULTIMATE.start_main_#t~mem9|=(- 2147477446), |ULTIMATE.start_main_~#A~0.base|=5, |ULTIMATE.start_main_~#A~0.offset|=0, |ULTIMATE.start_main_~#B~0.base|=2, |ULTIMATE.start_main_~#B~0.offset|=0, |ULTIMATE.start_main_~#C~0.base|=3, |ULTIMATE.start_main_~#C~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem11, main_#t~mem9, main_#t~mem10, main_#t~post8, main_~M~0, main_~#A~0.base, main_~#A~0.offset, main_~#B~0.base, main_~#B~0.offset, main_~#C~0.base, main_~#C~0.offset, main_~i~0; [L14] main_~M~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call main_~#B~0.base, main_~#B~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call main_~#C~0.base, main_~#C~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc main_~i~0; [L18] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L18-L19] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L19] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L19] call write~int(main_#t~nondet2, main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L19] havoc main_#t~nondet2; [L18] main_#t~post1 := main_~i~0; [L18] main_~i~0 := 1 + main_#t~post1; [L18] havoc main_#t~post1; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=1, main_~M~0=1] [L18-L19] assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L21] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L21-L22] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L22] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L22] call write~int(main_#t~nondet4, main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L22] havoc main_#t~nondet4; [L21] main_#t~post3 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post3; [L21] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=1, main_~M~0=1] [L21-L22] assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L24] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L24-L25] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L25] call main_#t~mem6 := read~int(main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call main_#t~mem7 := read~int(main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call write~int(main_#t~mem6 + main_#t~mem7, main_~#C~0.base, main_~#C~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] havoc main_#t~mem7; [L25] havoc main_#t~mem6; [L24] main_#t~post5 := main_~i~0; [L24] main_~i~0 := 1 + main_#t~post5; [L24] havoc main_#t~post5; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=1, main_~M~0=1] [L24-L25] assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L27] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L27-L28] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L28] call main_#t~mem11 := read~int(main_~#C~0.base, main_~#C~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call main_#t~mem9 := read~int(main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call main_#t~mem10 := read~int(main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] __VERIFIER_assert_#in~cond := (if main_#t~mem11 == main_#t~mem9 - main_#t~mem10 then 1 else 0); [L28] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L5-L7] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L6] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem11, main_#t~mem9, main_#t~mem10, main_#t~post8, main_~M~0, main_~#A~0.base, main_~#A~0.offset, main_~#B~0.base, main_~#B~0.offset, main_~#C~0.base, main_~#C~0.offset, main_~i~0; [L14] main_~M~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call main_~#B~0.base, main_~#B~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call main_~#C~0.base, main_~#C~0.offset := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc main_~i~0; [L18] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L18-L19] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L19] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L19] call write~int(main_#t~nondet2, main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L19] havoc main_#t~nondet2; [L18] main_#t~post1 := main_~i~0; [L18] main_~i~0 := 1 + main_#t~post1; [L18] havoc main_#t~post1; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=1, main_~M~0=1] [L18-L19] assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L21] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L21-L22] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L22] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L22] call write~int(main_#t~nondet4, main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L22] havoc main_#t~nondet4; [L21] main_#t~post3 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post3; [L21] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=1, main_~M~0=1] [L21-L22] assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L24] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L24-L25] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L25] call main_#t~mem6 := read~int(main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call main_#t~mem7 := read~int(main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call write~int(main_#t~mem6 + main_#t~mem7, main_~#C~0.base, main_~#C~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] havoc main_#t~mem7; [L25] havoc main_#t~mem6; [L24] main_#t~post5 := main_~i~0; [L24] main_~i~0 := 1 + main_#t~post5; [L24] havoc main_#t~post5; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=1, main_~M~0=1] [L24-L25] assume !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L27] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L27-L28] assume !!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296); [L28] call main_#t~mem11 := read~int(main_~#C~0.base, main_~#C~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call main_#t~mem9 := read~int(main_~#A~0.base, main_~#A~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call main_#t~mem10 := read~int(main_~#B~0.base, main_~#B~0.offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] __VERIFIER_assert_#in~cond := (if main_#t~mem11 == main_#t~mem9 - main_#t~mem10 then 1 else 0); [L28] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L5-L7] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [L6] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0.base=5, main_~#A~0.offset=0, main_~#B~0.base=2, main_~#B~0.offset=0, main_~#C~0.base=3, main_~#C~0.offset=0, main_~i~0=0, main_~M~0=1] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem11, main_#t~mem9, main_#t~mem10, main_#t~post8, main_~M~0, main_~#A~0, main_~#B~0, main_~#C~0, main_~i~0; [L14] main_~M~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] FCALL call main_~#A~0 := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call main_~#B~0 := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call main_~#C~0 := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc main_~i~0; [L18] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L18-L19] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L19] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L19] FCALL call write~int(main_#t~nondet2, { base: main_~#A~0!base, offset: main_~#A~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc main_#t~nondet2; [L18] main_#t~post1 := main_~i~0; [L18] main_~i~0 := 1 + main_#t~post1; [L18] havoc main_#t~post1; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=1, main_~M~0=1] [L18-L19] COND TRUE !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296) [L21] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L21-L22] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L22] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L22] FCALL call write~int(main_#t~nondet4, { base: main_~#B~0!base, offset: main_~#B~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc main_#t~nondet4; [L21] main_#t~post3 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post3; [L21] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=1, main_~M~0=1] [L21-L22] COND TRUE !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296) [L24] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L24-L25] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L25] FCALL call main_#t~mem6 := read~int({ base: main_~#A~0!base, offset: main_~#A~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call main_#t~mem7 := read~int({ base: main_~#B~0!base, offset: main_~#B~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(main_#t~mem6 + main_#t~mem7, { base: main_~#C~0!base, offset: main_~#C~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc main_#t~mem7; [L25] havoc main_#t~mem6; [L24] main_#t~post5 := main_~i~0; [L24] main_~i~0 := 1 + main_#t~post5; [L24] havoc main_#t~post5; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=1, main_~M~0=1] [L24-L25] COND TRUE !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296) [L27] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L27-L28] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L28] FCALL call main_#t~mem11 := read~int({ base: main_~#C~0!base, offset: main_~#C~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call main_#t~mem9 := read~int({ base: main_~#A~0!base, offset: main_~#A~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call main_#t~mem10 := read~int({ base: main_~#B~0!base, offset: main_~#B~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] __VERIFIER_assert_#in~cond := (if main_#t~mem11 == main_#t~mem9 - main_#t~mem10 then 1 else 0); [L28] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~mem11, main_#t~mem9, main_#t~mem10, main_#t~post8, main_~M~0, main_~#A~0, main_~#B~0, main_~#C~0, main_~i~0; [L14] main_~M~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] FCALL call main_~#A~0 := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call main_~#B~0 := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call main_~#C~0 := #Ultimate.alloc(4 * (if main_~M~0 % 4294967296 % 4294967296 <= 2147483647 then main_~M~0 % 4294967296 % 4294967296 else main_~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc main_~i~0; [L18] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L18-L19] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L19] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L19] FCALL call write~int(main_#t~nondet2, { base: main_~#A~0!base, offset: main_~#A~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc main_#t~nondet2; [L18] main_#t~post1 := main_~i~0; [L18] main_~i~0 := 1 + main_#t~post1; [L18] havoc main_#t~post1; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=1, main_~M~0=1] [L18-L19] COND TRUE !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296) [L21] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L21-L22] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L22] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L22] FCALL call write~int(main_#t~nondet4, { base: main_~#B~0!base, offset: main_~#B~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc main_#t~nondet4; [L21] main_#t~post3 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post3; [L21] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=1, main_~M~0=1] [L21-L22] COND TRUE !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296) [L24] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L24-L25] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L25] FCALL call main_#t~mem6 := read~int({ base: main_~#A~0!base, offset: main_~#A~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call main_#t~mem7 := read~int({ base: main_~#B~0!base, offset: main_~#B~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(main_#t~mem6 + main_#t~mem7, { base: main_~#C~0!base, offset: main_~#C~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc main_#t~mem7; [L25] havoc main_#t~mem6; [L24] main_#t~post5 := main_~i~0; [L24] main_~i~0 := 1 + main_#t~post5; [L24] havoc main_#t~post5; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=1, main_~M~0=1] [L24-L25] COND TRUE !(main_~i~0 % 4294967296 < main_~M~0 % 4294967296) [L27] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L27-L28] COND FALSE !(!(main_~i~0 % 4294967296 < main_~M~0 % 4294967296)) [L28] FCALL call main_#t~mem11 := read~int({ base: main_~#C~0!base, offset: main_~#C~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call main_#t~mem9 := read~int({ base: main_~#A~0!base, offset: main_~#A~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call main_#t~mem10 := read~int({ base: main_~#B~0!base, offset: main_~#B~0!offset + 4 * (if main_~i~0 % 4294967296 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 % 4294967296 else main_~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] __VERIFIER_assert_#in~cond := (if main_#t~mem11 == main_#t~mem9 - main_#t~mem10 then 1 else 0); [L28] havoc __VERIFIER_assert_~cond; [L4-L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem10=-2147477156, main_#t~mem11=-4294954602, main_#t~mem9=-2147477446, main_~#A~0!base=5, main_~#A~0!offset=0, main_~#B~0!base=2, main_~#B~0!offset=0, main_~#C~0!base=3, main_~#C~0!offset=0, main_~i~0=0, main_~M~0=1] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L18-L19] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] FCALL call write~int(#t~nondet2, { base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc #t~nondet2; [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0] [L18-L19] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L21-L22] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] FCALL call write~int(#t~nondet4, { base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc #t~nondet4; [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L21-L22] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) [L24] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L24-L25] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L25] FCALL call #t~mem6 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call #t~mem7 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(#t~mem6 + #t~mem7, { base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc #t~mem7; [L25] havoc #t~mem6; [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0] [L24-L25] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) [L27] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L27-L28] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L28] FCALL call #t~mem11 := read~int({ base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem9 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem10 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L4-L9] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L5] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L18-L19] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] FCALL call write~int(#t~nondet2, { base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc #t~nondet2; [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0] [L18-L19] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L21-L22] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] FCALL call write~int(#t~nondet4, { base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc #t~nondet4; [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L21-L22] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) [L24] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L24-L25] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L25] FCALL call #t~mem6 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call #t~mem7 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(#t~mem6 + #t~mem7, { base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc #t~mem7; [L25] havoc #t~mem6; [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0] [L24-L25] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) [L27] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L27-L28] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L28] FCALL call #t~mem11 := read~int({ base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem9 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem10 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L4-L9] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L5] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L14] unsigned int M = __VERIFIER_nondet_uint(); [L15] int A[M], B[M], C[M]; [L16] unsigned int i; [L18] i=0 [L18] COND TRUE i