./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c --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_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccae6f392e1d87c0b193f39dee91a5c51306cb93 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:50:39,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:50:39,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:50:39,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:50:39,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:50:39,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:50:39,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:50:39,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:50:39,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:50:39,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:50:39,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:50:39,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:50:39,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:50:39,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:50:39,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:50:39,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:50:39,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:50:39,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:50:39,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:50:39,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:50:39,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:50:39,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:50:39,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:50:39,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:50:39,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:50:39,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:50:39,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:50:39,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:50:39,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:50:39,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:50:39,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:50:39,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:50:39,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:50:39,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:50:39,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:50:39,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:50:39,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 07:50:39,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:50:39,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:50:39,427 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:50:39,428 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:50:39,428 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 07:50:39,428 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 07:50:39,428 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 07:50:39,428 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 07:50:39,428 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 07:50:39,428 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 07:50:39,429 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 07:50:39,429 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 07:50:39,429 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 07:50:39,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:50:39,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:50:39,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:50:39,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:50:39,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:50:39,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:50:39,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:50:39,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:50:39,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:50:39,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:50:39,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:50:39,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 07:50:39,433 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccae6f392e1d87c0b193f39dee91a5c51306cb93 [2018-11-23 07:50:39,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:50:39,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:50:39,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:50:39,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:50:39,471 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:50:39,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/../../sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:50:39,517 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/data/4b7a19186/147b81d94d2b4f5d8ab9d0aed887ee62/FLAG17c2b875c [2018-11-23 07:50:39,808 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:50:39,808 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:50:39,812 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/data/4b7a19186/147b81d94d2b4f5d8ab9d0aed887ee62/FLAG17c2b875c [2018-11-23 07:50:39,820 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/data/4b7a19186/147b81d94d2b4f5d8ab9d0aed887ee62 [2018-11-23 07:50:39,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:50:39,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:50:39,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:50:39,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:50:39,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:50:39,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,829 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 07:50:39, skipping insertion in model container [2018-11-23 07:50:39,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:50:39,849 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:50:39,950 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:50:39,953 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:50:39,961 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:50:39,968 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:50:39,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39 WrapperNode [2018-11-23 07:50:39,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:50:39,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:50:39,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:50:39,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:50:39,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:50:39,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:50:39,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:50:39,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:50:39,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... [2018-11-23 07:50:39,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:50:39,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:50:39,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:50:39,993 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:50:39,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:50:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure A [2018-11-23 07:50:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure A [2018-11-23 07:50:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:50:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:50:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:50:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:50:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:50:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:50:40,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:50:40,171 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 07:50:40,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:50:40 BoogieIcfgContainer [2018-11-23 07:50:40,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:50:40,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:50:40,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:50:40,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:50:40,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:50:39" (1/3) ... [2018-11-23 07:50:40,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e41a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:50:40, skipping insertion in model container [2018-11-23 07:50:40,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:50:39" (2/3) ... [2018-11-23 07:50:40,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e41a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:50:40, skipping insertion in model container [2018-11-23 07:50:40,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:50:40" (3/3) ... [2018-11-23 07:50:40,178 INFO L112 eAbstractionObserver]: Analyzing ICFG BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 07:50:40,187 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:50:40,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:50:40,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:50:40,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:50:40,232 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:50:40,232 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:50:40,232 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:50:40,232 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:50:40,232 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:50:40,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:50:40,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:50:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 07:50:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:50:40,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:50:40,253 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:50:40,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:50:40,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:50:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -284235614, now seen corresponding path program 1 times [2018-11-23 07:50:40,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:50:40,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:50:40,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:50:40,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:50:40,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:50:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:50:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:50:40,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:50:40,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:50:40,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-23 07:50:40,423 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [10], [11], [15], [17], [19], [22], [24], [32], [33], [34], [36], [37], [38], [39] [2018-11-23 07:50:40,446 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:50:40,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:50:40,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:50:40,539 INFO L272 AbstractInterpreter]: Visited 17 different actions 20 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 5. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 7 variables. [2018-11-23 07:50:40,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:50:40,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:50:40,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:50:40,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:50:40,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:50:40,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:50:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:50:40,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:50:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:50:40,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:50:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:50:40,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:50:40,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-11-23 07:50:40,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:50:40,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:50:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:50:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:50:40,690 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 07:50:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:50:40,768 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 07:50:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:50:40,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 07:50:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:50:40,776 INFO L225 Difference]: With dead ends: 45 [2018-11-23 07:50:40,776 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 07:50:40,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:50:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 07:50:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 07:50:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 07:50:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 07:50:40,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2018-11-23 07:50:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:50:40,804 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 07:50:40,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:50:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 07:50:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:50:40,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:50:40,805 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:50:40,805 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:50:40,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:50:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -920468714, now seen corresponding path program 1 times [2018-11-23 07:50:40,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:50:40,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:50:40,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:50:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:50:40,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:50:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:50:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:50:40,849 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~g~0)|=2, ~g~0=2] [?] ~g~0 := 0; VAL [|old(~g~0)|=2, ~g~0=0] [?] assume true; VAL [|old(~g~0)|=2, ~g~0=0] [?] RET #33#return; VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [|old(~g~0)|=0, ~g~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~g~1 := #t~nondet1;havoc #t~nondet1;~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=0] [?] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [|A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] assume 0 != ~a1; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=0] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=1] [?] assume true; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=1] [?] RET #31#return; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=0, ~g~0=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=1] [?] assume true; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=1] [?] RET #37#return; VAL [main_~g~1=1, main_~h~0=0, |main_#t~ret2|=0, |old(~g~0)|=0, ~g~0=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;havoc #t~ret2; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [|A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] assume 0 != ~a1; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] assume true; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] RET #31#return; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=1, ~g~0=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] assume true; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] RET #39#return; VAL [main_~g~1=1, main_~h~0=0, |main_#t~ret3|=0, |old(~g~0)|=0, ~g~0=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;havoc #t~ret3; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] assume 0 != ~g~1; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] assume !false; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] ensures true; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] assume 0 != ~g~1; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] ensures true; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] assume 0 != ~g~1; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L14] int g; VAL [\old(g)=2, g=0] [L26] int g = __VERIFIER_nondet_int(); [L27] int h = !g; VAL [\old(g)=0, g=0, g=1, h=0] [L28] CALL A(g,h) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, a1=1, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=1, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=1, \old(g)=0, a1=0, a2=1, g=1] [L18] RET A(a2,a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, A(a2,a1)=0, a1=1, a2=0, g=1] [L28] RET A(g,h) VAL [\old(g)=0, A(g,h)=0, g=1, g=1, h=0] [L29] CALL A(g,h) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, g=1] [L17] COND TRUE \read(a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, a1=1, a2=0, g=1] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=1, \old(g)=1, g=1] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=1, \old(g)=1, a1=0, a2=1, g=1] [L18] RET A(a2,a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, A(a2,a1)=0, a1=1, a2=0, g=1] [L29] RET A(g,h) VAL [\old(g)=0, A(g,h)=0, g=1, g=1, h=0] [L30] COND TRUE \read(g) VAL [\old(g)=0, g=1, g=1, h=0] [L31] __VERIFIER_error() VAL [\old(g)=0, g=1, g=1, h=0] ----- [2018-11-23 07:50:40,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:50:40 BoogieIcfgContainer [2018-11-23 07:50:40,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:50:40,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:50:40,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:50:40,883 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:50:40,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:50:40" (3/4) ... [2018-11-23 07:50:40,885 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~g~0)|=2, ~g~0=2] [?] ~g~0 := 0; VAL [|old(~g~0)|=2, ~g~0=0] [?] assume true; VAL [|old(~g~0)|=2, ~g~0=0] [?] RET #33#return; VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [|old(~g~0)|=0, ~g~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~g~1 := #t~nondet1;havoc #t~nondet1;~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=0] [?] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [|A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] assume 0 != ~a1; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=0] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=1] [?] assume true; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=0, ~g~0=1] [?] RET #31#return; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=0, ~g~0=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=1] [?] assume true; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=1] [?] RET #37#return; VAL [main_~g~1=1, main_~h~0=0, |main_#t~ret2|=0, |old(~g~0)|=0, ~g~0=1] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;havoc #t~ret2; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [|A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] assume 0 != ~a1; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] assume true; VAL [A_~a1=0, A_~a2=1, |A_#in~a1|=0, |A_#in~a2|=1, |old(~g~0)|=1, ~g~0=1] [?] RET #31#return; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=1, ~g~0=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] assume true; VAL [A_~a1=1, A_~a2=0, |A_#in~a1|=1, |A_#in~a2|=0, |old(~g~0)|=1, ~g~0=1] [?] RET #39#return; VAL [main_~g~1=1, main_~h~0=0, |main_#t~ret3|=0, |old(~g~0)|=0, ~g~0=1] [?] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;havoc #t~ret3; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] assume 0 != ~g~1; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] assume !false; VAL [main_~g~1=1, main_~h~0=0, |old(~g~0)|=0, ~g~0=1] [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] ensures true; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] assume 0 != ~g~1; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] ensures true; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L16-L22] ensures true; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] assume 0 != ~g~1; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~g~0)=2, ~g~0=2] [L14] ~g~0 := 0; VAL [old(~g~0)=2, ~g~0=0] [?] RET call ULTIMATE.init(); VAL [~g~0=0] [?] CALL call #t~ret4 := main(); VAL [old(~g~0)=0, ~g~0=0] [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [old(~g~0)=0, ~g~0=0, ~g~1=1, ~h~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=0, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=0, ~a1=1, ~a2=0, ~g~0=1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [#t~ret2=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~g~0=1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=1, old(~g~0)=1, ~a1=0, ~a2=1, ~g~0=1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=1, #in~a2=0, #t~ret0=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=1, #in~a2=0, old(~g~0)=1, ~a1=1, ~a2=0, ~g~0=1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [#t~ret3=0, old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L30-L32] COND TRUE 0 != ~g~1 VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L31] assert false; VAL [old(~g~0)=0, ~g~0=1, ~g~1=1, ~h~0=0] [L14] int g; VAL [\old(g)=2, g=0] [L26] int g = __VERIFIER_nondet_int(); [L27] int h = !g; VAL [\old(g)=0, g=0, g=1, h=0] [L28] CALL A(g,h) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, a1=1, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=1, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=1, \old(g)=0, a1=0, a2=1, g=1] [L18] RET A(a2,a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, A(a2,a1)=0, a1=1, a2=0, g=1] [L28] RET A(g,h) VAL [\old(g)=0, A(g,h)=0, g=1, g=1, h=0] [L29] CALL A(g,h) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, g=1] [L17] COND TRUE \read(a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, a1=1, a2=0, g=1] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=1, \old(g)=1, g=1] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=1, \old(g)=1, a1=0, a2=1, g=1] [L18] RET A(a2,a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, A(a2,a1)=0, a1=1, a2=0, g=1] [L29] RET A(g,h) VAL [\old(g)=0, A(g,h)=0, g=1, g=1, h=0] [L30] COND TRUE \read(g) VAL [\old(g)=0, g=1, g=1, h=0] [L31] __VERIFIER_error() VAL [\old(g)=0, g=1, g=1, h=0] ----- [2018-11-23 07:50:40,930 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_53e28a4e-07e7-4680-8f0b-0540ecf518ac/bin-2019/utaipan/witness.graphml [2018-11-23 07:50:40,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:50:40,930 INFO L168 Benchmark]: Toolchain (without parser) took 1108.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -96.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:50:40,932 INFO L168 Benchmark]: CDTParser took 0.16 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 07:50:40,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.48 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:50:40,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.50 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:50:40,932 INFO L168 Benchmark]: Boogie Preprocessor took 10.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.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 07:50:40,933 INFO L168 Benchmark]: RCFGBuilder took 179.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:50:40,933 INFO L168 Benchmark]: TraceAbstraction took 709.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.7 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:50:40,934 INFO L168 Benchmark]: Witness Printer took 47.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:50:40,936 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.16 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 145.48 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.50 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 709.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.7 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. * Witness Printer took 47.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int g; VAL [\old(g)=2, g=0] [L26] int g = __VERIFIER_nondet_int(); [L27] int h = !g; VAL [\old(g)=0, g=0, g=1, h=0] [L28] CALL A(g,h) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, a1=1, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=1, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=1, \old(g)=0, a1=0, a2=1, g=1] [L18] RET A(a2,a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=0, A(a2,a1)=0, a1=1, a2=0, g=1] [L28] RET A(g,h) VAL [\old(g)=0, A(g,h)=0, g=1, g=1, h=0] [L29] CALL A(g,h) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, g=1] [L17] COND TRUE \read(a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, a1=1, a2=0, g=1] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=1, \old(g)=1, g=1] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=1, \old(g)=1, a1=0, a2=1, g=1] [L18] RET A(a2,a1) VAL [\old(a1)=1, \old(a2)=0, \old(g)=1, A(a2,a1)=0, a1=1, a2=0, g=1] [L29] RET A(g,h) VAL [\old(g)=0, A(g,h)=0, g=1, g=1, h=0] [L30] COND TRUE \read(g) VAL [\old(g)=0, g=1, g=1, h=0] [L31] __VERIFIER_error() VAL [\old(g)=0, g=1, g=1, h=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 4 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 8 SDslu, 43 SDs, 0 SdLazy, 36 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 1976 SizeOfPredicates, 2 NumberOfNonLiveVariables, 66 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 0 PerfectInterpolantSequences, 3/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...