./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum03_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_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:32:37,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:32:37,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:32:37,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:32:37,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:32:37,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:32:37,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:32:37,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:32:37,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:32:37,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:32:37,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:32:37,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:32:37,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:32:37,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:32:37,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:32:37,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:32:37,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:32:37,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:32:37,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:32:37,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:32:37,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:32:37,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:32:37,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:32:37,295 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:32:37,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:32:37,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:32:37,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:32:37,298 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:32:37,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:32:37,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:32:37,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:32:37,301 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:32:37,301 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:32:37,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:32:37,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:32:37,303 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:32:37,303 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 06:32:37,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:32:37,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:32:37,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:32:37,318 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:32:37,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:32:37,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:32:37,319 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:32:37,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:32:37,319 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:32:37,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:32:37,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:32:37,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:32:37,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:32:37,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:32:37,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:32:37,320 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:32:37,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:32:37,321 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:32:37,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:32:37,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:32:37,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:32:37,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:32:37,324 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:32:37,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:32:37,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:32:37,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:32:37,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:32:37,324 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:32:37,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:32:37,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:32:37,325 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_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 [2018-11-23 06:32:37,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:32:37,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:32:37,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:32:37,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:32:37,372 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:32:37,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/../../sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.i [2018-11-23 06:32:37,417 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/data/9b9598ff8/101c863129a044049a28c1d5ed98daeb/FLAGdc2eaa023 [2018-11-23 06:32:37,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:32:37,776 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/sv-benchmarks/c/loops/sum03_false-unreach-call_true-termination.i [2018-11-23 06:32:37,780 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/data/9b9598ff8/101c863129a044049a28c1d5ed98daeb/FLAGdc2eaa023 [2018-11-23 06:32:37,791 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/data/9b9598ff8/101c863129a044049a28c1d5ed98daeb [2018-11-23 06:32:37,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:32:37,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:32:37,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:32:37,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:32:37,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:32:37,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:37,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108971e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37, skipping insertion in model container [2018-11-23 06:32:37,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:37,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:32:37,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:32:37,954 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:32:37,956 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:32:37,967 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:32:37,981 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:32:37,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37 WrapperNode [2018-11-23 06:32:37,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:32:37,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:32:37,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:32:37,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:32:37,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:37,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:37,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:32:37,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:32:37,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:32:37,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:32:38,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... [2018-11-23 06:32:38,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:32:38,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:32:38,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:32:38,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:32:38,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:32:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:32:38,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:32:38,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:32:38,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:32:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:32:38,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:32:38,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 06:32:38,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 06:32:38,249 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:32:38,249 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 06:32:38,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:38 BoogieIcfgContainer [2018-11-23 06:32:38,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:32:38,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:32:38,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:32:38,253 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:32:38,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:32:37" (1/3) ... [2018-11-23 06:32:38,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:32:38, skipping insertion in model container [2018-11-23 06:32:38,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:37" (2/3) ... [2018-11-23 06:32:38,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:32:38, skipping insertion in model container [2018-11-23 06:32:38,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:38" (3/3) ... [2018-11-23 06:32:38,257 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-11-23 06:32:38,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:32:38,275 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:32:38,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:32:38,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:32:38,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:32:38,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:32:38,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:32:38,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:32:38,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:32:38,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:32:38,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:32:38,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:32:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 06:32:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:32:38,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:32:38,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:32:38,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:32:38,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:32:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1345568573, now seen corresponding path program 1 times [2018-11-23 06:32:38,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:32:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:32:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:38,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:32:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:32:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:32:38,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:32:38,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 06:32:38,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:32:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:32:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:32:38,614 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 6 states. [2018-11-23 06:32:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:32:38,716 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-23 06:32:38,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:32:38,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 06:32:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:32:38,724 INFO L225 Difference]: With dead ends: 38 [2018-11-23 06:32:38,724 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 06:32:38,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:32:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 06:32:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 06:32:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 06:32:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 06:32:38,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2018-11-23 06:32:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:32:38,759 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 06:32:38,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:32:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 06:32:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:32:38,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:32:38,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:32:38,761 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:32:38,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:32:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1402826875, now seen corresponding path program 1 times [2018-11-23 06:32:38,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:32:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:32:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:32:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:32:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:32:38,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:32:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:32:38,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:32:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:32:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:32:38,846 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 06:32:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:32:38,886 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 06:32:38,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:32:38,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 06:32:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:32:38,888 INFO L225 Difference]: With dead ends: 35 [2018-11-23 06:32:38,888 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 06:32:38,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:32:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 06:32:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 06:32:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:32:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 06:32:38,897 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 12 [2018-11-23 06:32:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:32:38,897 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 06:32:38,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:32:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 06:32:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 06:32:38,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:32:38,898 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:32:38,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:32:38,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:32:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1436486517, now seen corresponding path program 1 times [2018-11-23 06:32:38,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:32:38,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:32:38,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:38,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:32:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:32:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:32:38,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:32:38,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:32:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:32:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:32:39,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:32:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:32:39,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:32:39,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 06:32:39,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:32:39,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:32:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:32:39,100 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2018-11-23 06:32:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:32:39,121 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 06:32:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:32:39,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 06:32:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:32:39,123 INFO L225 Difference]: With dead ends: 48 [2018-11-23 06:32:39,123 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 06:32:39,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:32:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 06:32:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 06:32:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 06:32:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 06:32:39,132 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-11-23 06:32:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:32:39,134 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 06:32:39,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:32:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 06:32:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 06:32:39,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:32:39,135 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:32:39,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:32:39,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:32:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1136980881, now seen corresponding path program 2 times [2018-11-23 06:32:39,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:32:39,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:32:39,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:39,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:32:39,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:32:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 06:32:39,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:32:39,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:32:39,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:32:39,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:32:39,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:32:39,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:32:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 06:32:39,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:32:39,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 06:32:39,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:32:39,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:32:39,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:32:39,280 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-11-23 06:32:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:32:39,346 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 06:32:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:32:39,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 06:32:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:32:39,348 INFO L225 Difference]: With dead ends: 44 [2018-11-23 06:32:39,348 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 06:32:39,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:32:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 06:32:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 06:32:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:32:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 06:32:39,356 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2018-11-23 06:32:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:32:39,356 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 06:32:39,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:32:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 06:32:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 06:32:39,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:32:39,358 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:32:39,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:32:39,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:32:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1851034775, now seen corresponding path program 3 times [2018-11-23 06:32:39,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:32:39,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:32:39,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:39,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:32:39,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:32:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:32:39,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:32:39,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:32:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:33:03,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 06:33:03,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:33:03,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:33:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 06:33:03,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:33:03,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 06:33:03,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:33:03,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:33:03,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:33:03,183 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-11-23 06:33:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:03,228 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 06:33:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:33:03,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 06:33:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:03,230 INFO L225 Difference]: With dead ends: 48 [2018-11-23 06:33:03,230 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 06:33:03,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:33:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 06:33:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 06:33:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 06:33:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 06:33:03,237 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2018-11-23 06:33:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:03,237 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 06:33:03,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:33:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 06:33:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 06:33:03,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:03,239 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:03,239 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:03,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash 103432291, now seen corresponding path program 4 times [2018-11-23 06:33:03,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:33:03,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:33:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:03,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:33:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 06:33:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:03,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:33:03,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:33:03,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:33:03,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:33:03,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:33:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 06:33:03,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:33:03,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 06:33:03,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:33:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:33:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:33:03,413 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2018-11-23 06:33:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:03,485 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 06:33:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:33:03,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 06:33:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:03,486 INFO L225 Difference]: With dead ends: 52 [2018-11-23 06:33:03,486 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 06:33:03,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:33:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 06:33:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 06:33:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 06:33:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 06:33:03,493 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 44 [2018-11-23 06:33:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:03,493 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 06:33:03,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:33:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 06:33:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 06:33:03,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:03,494 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:03,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:03,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1878094685, now seen corresponding path program 5 times [2018-11-23 06:33:03,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:33:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:33:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:03,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:33:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 06:33:03,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:03,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:33:03,624 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 06:33:43,824 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 06:33:43,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:33:44,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:33:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 06:33:44,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:33:44,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 06:33:44,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 06:33:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 06:33:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:33:44,482 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2018-11-23 06:33:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:44,564 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 06:33:44,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:33:44,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-23 06:33:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:44,566 INFO L225 Difference]: With dead ends: 56 [2018-11-23 06:33:44,566 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 06:33:44,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:33:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 06:33:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 06:33:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 06:33:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 06:33:44,574 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 52 [2018-11-23 06:33:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:44,574 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 06:33:44,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 06:33:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 06:33:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 06:33:44,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:44,576 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:44,576 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:44,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1262160983, now seen corresponding path program 6 times [2018-11-23 06:33:44,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:33:44,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:33:44,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:44,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:33:44,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 06:33:44,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:44,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:33:44,727 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 06:34:11,494 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-23 06:34:11,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:34:11,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:21,711 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 06:34:23,796 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 06:34:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 87 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 06:34:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:34:23,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-11-23 06:34:23,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 06:34:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 06:34:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=327, Unknown=3, NotChecked=0, Total=380 [2018-11-23 06:34:23,823 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 20 states. [2018-11-23 06:34:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:34:24,136 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-23 06:34:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 06:34:24,136 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-23 06:34:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:34:24,137 INFO L225 Difference]: With dead ends: 62 [2018-11-23 06:34:24,137 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 06:34:24,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=74, Invalid=523, Unknown=3, NotChecked=0, Total=600 [2018-11-23 06:34:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 06:34:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 06:34:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 06:34:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-23 06:34:24,141 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 60 [2018-11-23 06:34:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:34:24,141 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-23 06:34:24,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 06:34:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 06:34:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 06:34:24,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:34:24,142 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:34:24,143 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:34:24,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash 977341265, now seen corresponding path program 7 times [2018-11-23 06:34:24,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:24,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:24,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:34:24,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 06:34:24,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:34:24,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:34:24,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:24,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 06:34:24,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:34:24,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 06:34:24,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 06:34:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 06:34:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:34:24,337 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2018-11-23 06:34:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:34:24,411 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-23 06:34:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:34:24,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 06:34:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:34:24,412 INFO L225 Difference]: With dead ends: 64 [2018-11-23 06:34:24,412 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 06:34:24,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 06:34:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 06:34:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 06:34:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 06:34:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-23 06:34:24,417 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 68 [2018-11-23 06:34:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:34:24,418 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-23 06:34:24,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 06:34:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-23 06:34:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 06:34:24,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:34:24,419 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:34:24,419 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:34:24,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 87912523, now seen corresponding path program 8 times [2018-11-23 06:34:24,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:24,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:24,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:34:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 06:34:24,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:34:24,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:34:24,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 06:34:24,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 06:34:24,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:34:24,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:34:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 06:34:24,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:34:24,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 06:34:24,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:34:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:34:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:34:24,654 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 12 states. [2018-11-23 06:34:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:34:24,776 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 06:34:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 06:34:24,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 06:34:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:34:24,777 INFO L225 Difference]: With dead ends: 68 [2018-11-23 06:34:24,777 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 06:34:24,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:34:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 06:34:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 06:34:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 06:34:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-23 06:34:24,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 76 [2018-11-23 06:34:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:34:24,785 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-23 06:34:24,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:34:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-23 06:34:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 06:34:24,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:34:24,787 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:34:24,787 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:34:24,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:34:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1704314043, now seen corresponding path program 9 times [2018-11-23 06:34:24,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:34:24,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:34:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:24,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:34:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:34:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:34:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 06:34:24,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:34:24,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:34:24,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:36:02,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 06:36:02,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:36:02,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:36:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 06:36:02,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:36:02,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 06:36:02,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 06:36:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:36:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:36:02,994 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 13 states. [2018-11-23 06:36:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:36:03,153 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2018-11-23 06:36:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:36:03,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-11-23 06:36:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:36:03,154 INFO L225 Difference]: With dead ends: 72 [2018-11-23 06:36:03,154 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 06:36:03,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:36:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 06:36:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 06:36:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 06:36:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-11-23 06:36:03,159 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 84 [2018-11-23 06:36:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:36:03,160 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-11-23 06:36:03,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 06:36:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-11-23 06:36:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 06:36:03,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:36:03,161 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:36:03,161 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:36:03,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:36:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash 234974271, now seen corresponding path program 10 times [2018-11-23 06:36:03,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:36:03,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:36:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:03,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:36:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:36:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:36:03,224 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret3 := main(); [?] ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0, main_~x~0=0] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0, main_~x~0=0] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=0] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=1] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=2] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=3] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=4] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=5] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=6] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=7] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=8] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=9] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] assume !(~x~0 % 4294967296 < 10); VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14-L16] assume !(~x~0 % 4294967296 < 10); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14-L16] assume !(~x~0 % 4294967296 < 10); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 06:36:03,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:36:03 BoogieIcfgContainer [2018-11-23 06:36:03,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:36:03,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:36:03,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:36:03,325 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:36:03,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:38" (3/4) ... [2018-11-23 06:36:03,327 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret3 := main(); [?] ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0, main_~x~0=0] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=0, main_~x~0=0] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=0] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=2, main_~x~0=1] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=1] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=4, main_~x~0=2] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=2] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=6, main_~x~0=3] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=3] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=8, main_~x~0=4] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=4] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=10, main_~x~0=5] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=5] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=12, main_~x~0=6] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=6] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=14, main_~x~0=7] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=7] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=16, main_~x~0=8] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=8] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=18, main_~x~0=9] [?] assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=9] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #42#return; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] assume !false; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] assume !(~x~0 % 4294967296 < 10); VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=10] [?] #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~loop1~0=2, main_~n1~0=3, main_~sn~0=20, main_~x~0=11] [?] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14-L16] assume !(~x~0 % 4294967296 < 10); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14-L16] assume ~x~0 % 4294967296 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3-L5] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L2-L7] ensures true; VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] assume !false; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14-L16] assume !(~x~0 % 4294967296 < 10); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3-L5] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~sn~0 := 0; [L11] ~loop1~0 := #t~nondet0; [L11] havoc #t~nondet0; [L11] ~n1~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~x~0 := 0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=0, ~x~0=0] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=0] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=2, ~x~0=1] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=1] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=4, ~x~0=2] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=2] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=6, ~x~0=3] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=3] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=8, ~x~0=4] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=4] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=10, ~x~0=5] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=5] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=12, ~x~0=6] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=6] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=14, ~x~0=7] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=7] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=16, ~x~0=8] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=8] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=18, ~x~0=9] [L14] COND TRUE ~x~0 % 4294967296 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=9] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=1] [L2-L7] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L3] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L18] RET call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L13-L19] COND FALSE !(false) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L14] COND FALSE !(~x~0 % 4294967296 < 10) VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=10] [L17] #t~post2 := ~x~0; [L17] ~x~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~loop1~0=2, ~n1~0=3, ~sn~0=20, ~x~0=11] [L18] CALL call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L4] assert false; VAL [#in~cond=0, ~cond=0] [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 06:36:03,708 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3dbc5a3c-3838-4b47-956e-5cc14b2a34c4/bin-2019/uautomizer/witness.graphml [2018-11-23 06:36:03,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:36:03,709 INFO L168 Benchmark]: Toolchain (without parser) took 205915.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 959.1 MB in the beginning and 889.4 MB in the end (delta: 69.7 MB). Peak memory consumption was 279.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:03,709 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:03,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.37 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:03,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.13 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:36:03,712 INFO L168 Benchmark]: Boogie Preprocessor took 17.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:03,712 INFO L168 Benchmark]: RCFGBuilder took 233.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:03,713 INFO L168 Benchmark]: TraceAbstraction took 205073.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 899.2 MB in the end (delta: 237.0 MB). Peak memory consumption was 294.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:03,713 INFO L168 Benchmark]: Witness Printer took 383.36 ms. Allocated memory is still 1.2 GB. Free memory was 899.2 MB in the beginning and 889.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:36:03,715 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.37 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.13 ms. Allocated memory is still 1.0 GB. Free memory is still 948.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.66 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 233.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 205073.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 899.2 MB in the end (delta: 237.0 MB). Peak memory consumption was 294.1 MB. Max. memory is 11.5 GB. * Witness Printer took 383.36 ms. Allocated memory is still 1.2 GB. Free memory was 899.2 MB in the beginning and 889.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 205.0s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 77 SDslu, 1284 SDs, 0 SdLazy, 1383 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 452 SyntacticMatches, 20 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 188.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 208664 SizeOfPredicates, 10 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 1305/2460 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...