./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.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_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/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 d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:43:27,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:43:27,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:43:27,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:43:27,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:43:27,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:43:27,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:43:27,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:43:27,589 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:43:27,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:43:27,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:43:27,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:43:27,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:43:27,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:43:27,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:43:27,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:43:27,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:43:27,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:43:27,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:43:27,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:43:27,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:43:27,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:43:27,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:43:27,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:43:27,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:43:27,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:43:27,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:43:27,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:43:27,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:43:27,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:43:27,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:43:27,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:43:27,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:43:27,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:43:27,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:43:27,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:43:27,610 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 15:43:27,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:43:27,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:43:27,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:43:27,622 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:43:27,622 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:43:27,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:43:27,622 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:43:27,622 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:43:27,623 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:43:27,623 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:43:27,623 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:43:27,623 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:43:27,623 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:43:27,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:43:27,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:43:27,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:43:27,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:43:27,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:43:27,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:43:27,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:43:27,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:43:27,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:43:27,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:43:27,625 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:43:27,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:43:27,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:43:27,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:43:27,626 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:43:27,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:43:27,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:43:27,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:43:27,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:43:27,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:43:27,629 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:43:27,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:43:27,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:43:27,629 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 15:43:27,630 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_3cce29d3-3012-482c-97ed-adb4cd2fa793/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 -> d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 [2018-11-23 15:43:27,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:43:27,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:43:27,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:43:27,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:43:27,666 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:43:27,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 15:43:27,709 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/data/31fae1228/96b3a51032674242adef14762fdba840/FLAGa5488a3a6 [2018-11-23 15:43:28,041 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:43:28,041 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 15:43:28,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/data/31fae1228/96b3a51032674242adef14762fdba840/FLAGa5488a3a6 [2018-11-23 15:43:28,472 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/data/31fae1228/96b3a51032674242adef14762fdba840 [2018-11-23 15:43:28,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:43:28,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:43:28,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:43:28,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:43:28,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:43:28,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28, skipping insertion in model container [2018-11-23 15:43:28,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:43:28,498 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:43:28,605 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:43:28,608 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:43:28,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:43:28,625 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:43:28,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28 WrapperNode [2018-11-23 15:43:28,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:43:28,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:43:28,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:43:28,626 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:43:28,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:43:28,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:43:28,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:43:28,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:43:28,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... [2018-11-23 15:43:28,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:43:28,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:43:28,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:43:28,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:43:28,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/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 15:43:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:43:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:43:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:43:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:43:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:43:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:43:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 15:43:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 15:43:28,814 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:43:28,814 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 15:43:28,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:28 BoogieIcfgContainer [2018-11-23 15:43:28,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:43:28,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:43:28,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:43:28,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:43:28,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:43:28" (1/3) ... [2018-11-23 15:43:28,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e29b3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:43:28, skipping insertion in model container [2018-11-23 15:43:28,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:28" (2/3) ... [2018-11-23 15:43:28,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e29b3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:43:28, skipping insertion in model container [2018-11-23 15:43:28,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:28" (3/3) ... [2018-11-23 15:43:28,819 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 15:43:28,825 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:43:28,829 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:43:28,839 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:43:28,857 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:43:28,857 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:43:28,857 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:43:28,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:43:28,857 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:43:28,857 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:43:28,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:43:28,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:43:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 15:43:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:43:28,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:28,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:28,874 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:28,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 15:43:28,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:28,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:28,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:29,045 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 15:43:29,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:43:29,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:43:29,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:43:29,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:43:29,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:43:29,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:43:29,064 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 15:43:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:29,098 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 15:43:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:43:29,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 15:43:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:29,108 INFO L225 Difference]: With dead ends: 32 [2018-11-23 15:43:29,108 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 15:43:29,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:43:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 15:43:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 15:43:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:43:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 15:43:29,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 15:43:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:29,139 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 15:43:29,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:43:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 15:43:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:43:29,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:29,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:29,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:29,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 15:43:29,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:29,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:29,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 15:43:29,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:29,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:29,284 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-23 15:43:29,285 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-11-23 15:43:29,308 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:43:29,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:43:29,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:43:29,437 INFO L272 AbstractInterpreter]: Visited 17 different actions 57 times. Merged at 5 different actions 21 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 3. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-23 15:43:29,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:29,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:43:29,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:29,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/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 15:43:29,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:29,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:43:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:29,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 15:43:29,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 15:43:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 15:43:29,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:29,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:43:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:43:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:43:29,653 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-11-23 15:43:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:29,688 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 15:43:29,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:43:29,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 15:43:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:29,689 INFO L225 Difference]: With dead ends: 25 [2018-11-23 15:43:29,689 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 15:43:29,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:43:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 15:43:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 15:43:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 15:43:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 15:43:29,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 15:43:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:29,695 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 15:43:29,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:43:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 15:43:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:43:29,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:29,696 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:29,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:29,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 15:43:29,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:29,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:29,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 15:43:29,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:29,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:29,801 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:29,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:29,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:29,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:29,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:43:29,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:43:29,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 15:43:29,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:29,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 15:43:29,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 15:43:30,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:30,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-23 15:43:30,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:30,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:43:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:43:30,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:43:30,054 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-23 15:43:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:30,075 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 15:43:30,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:43:30,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 15:43:30,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:30,076 INFO L225 Difference]: With dead ends: 28 [2018-11-23 15:43:30,076 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 15:43:30,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:43:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 15:43:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 15:43:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:43:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 15:43:30,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 15:43:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:30,080 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 15:43:30,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:43:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 15:43:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 15:43:30,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:30,081 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:30,082 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:30,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:30,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 15:43:30,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:30,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:30,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 15:43:30,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:30,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:30,194 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:30,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:30,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:30,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:43:30,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:43:30,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:43:30,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:30,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 15:43:30,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 15:43:30,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:30,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-23 15:43:30,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:30,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:43:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:43:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-23 15:43:30,462 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-11-23 15:43:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:30,492 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 15:43:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:43:30,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 15:43:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:30,493 INFO L225 Difference]: With dead ends: 31 [2018-11-23 15:43:30,494 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 15:43:30,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-23 15:43:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 15:43:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 15:43:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 15:43:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 15:43:30,499 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 15:43:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:30,499 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 15:43:30,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:43:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 15:43:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:43:30,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:30,500 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:30,500 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:30,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 15:43:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:30,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:30,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 15:43:30,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:30,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:30,625 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:30,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:30,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:30,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:30,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:30,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:43:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:30,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 15:43:30,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 15:43:30,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:30,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-23 15:43:30,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:43:30,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:43:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:43:30,996 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-11-23 15:43:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:31,042 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 15:43:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:43:31,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-23 15:43:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:31,043 INFO L225 Difference]: With dead ends: 34 [2018-11-23 15:43:31,043 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 15:43:31,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:43:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 15:43:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 15:43:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:43:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 15:43:31,046 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 15:43:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:31,046 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 15:43:31,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:43:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 15:43:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 15:43:31,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:31,047 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:31,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:31,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 15:43:31,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:31,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:31,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:31,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 15:43:31,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:31,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:31,192 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:31,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:31,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:31,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/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 15:43:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:43:31,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:43:31,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 15:43:31,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:31,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 15:43:31,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 15:43:31,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:31,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-23 15:43:31,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:31,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 15:43:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 15:43:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-11-23 15:43:31,616 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-11-23 15:43:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:31,668 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 15:43:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 15:43:31,668 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-11-23 15:43:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:31,669 INFO L225 Difference]: With dead ends: 37 [2018-11-23 15:43:31,669 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 15:43:31,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-11-23 15:43:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 15:43:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 15:43:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:43:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 15:43:31,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 15:43:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:31,675 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 15:43:31,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 15:43:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 15:43:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 15:43:31,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:31,677 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:31,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:31,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-23 15:43:31,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:31,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:31,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:31,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:31,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 15:43:31,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:31,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:31,855 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:31,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:31,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:31,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/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 15:43:31,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:43:31,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:43:31,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:43:31,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:31,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 15:43:31,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 15:43:32,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:32,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-23 15:43:32,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:32,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 15:43:32,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 15:43:32,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 15:43:32,403 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-11-23 15:43:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:32,459 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 15:43:32,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 15:43:32,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-23 15:43:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:32,461 INFO L225 Difference]: With dead ends: 40 [2018-11-23 15:43:32,461 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 15:43:32,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 15:43:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 15:43:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 15:43:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 15:43:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 15:43:32,466 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 15:43:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:32,467 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 15:43:32,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 15:43:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 15:43:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 15:43:32,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:32,468 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:32,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:32,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-23 15:43:32,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:32,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:32,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 15:43:32,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:32,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:32,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:32,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:32,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:32,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/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 15:43:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:32,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:43:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:32,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 15:43:32,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 15:43:33,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:33,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-23 15:43:33,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:33,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 15:43:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 15:43:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 15:43:33,244 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-11-23 15:43:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:33,312 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 15:43:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 15:43:33,313 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-23 15:43:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:33,314 INFO L225 Difference]: With dead ends: 43 [2018-11-23 15:43:33,314 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:43:33,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 15:43:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:43:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 15:43:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:43:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 15:43:33,319 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 15:43:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:33,319 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 15:43:33,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 15:43:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 15:43:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 15:43:33,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:33,320 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:33,320 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:33,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-23 15:43:33,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:33,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 15:43:33,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:33,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:33,512 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:33,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:33,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:33,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/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 15:43:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:43:33,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:43:33,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 15:43:33,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:33,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 15:43:33,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 15:43:34,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:34,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-23 15:43:34,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:34,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 15:43:34,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 15:43:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 15:43:34,330 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-11-23 15:43:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:34,410 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 15:43:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 15:43:34,410 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-11-23 15:43:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:34,411 INFO L225 Difference]: With dead ends: 46 [2018-11-23 15:43:34,411 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 15:43:34,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 15:43:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 15:43:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 15:43:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 15:43:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 15:43:34,415 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 15:43:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:34,415 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 15:43:34,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 15:43:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 15:43:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 15:43:34,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:34,416 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:34,417 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:34,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:34,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-23 15:43:34,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:34,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:34,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:34,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:34,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 15:43:34,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:34,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:34,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:34,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:34,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:34,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/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 15:43:34,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:43:34,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:43:34,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:43:34,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:34,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 15:43:34,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 15:43:35,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:35,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-23 15:43:35,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:35,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 15:43:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 15:43:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 15:43:35,639 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2018-11-23 15:43:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:35,746 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 15:43:35,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 15:43:35,746 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 15:43:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:35,747 INFO L225 Difference]: With dead ends: 49 [2018-11-23 15:43:35,747 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 15:43:35,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 15:43:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 15:43:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 15:43:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 15:43:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 15:43:35,750 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 15:43:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:35,751 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 15:43:35,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 15:43:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 15:43:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 15:43:35,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:35,752 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:35,752 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:35,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-23 15:43:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:35,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:35,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:35,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 15:43:36,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:36,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:36,006 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:36,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:36,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:36,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:36,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:36,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:43:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:36,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 15:43:36,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 15:43:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-23 15:43:37,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:37,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 15:43:37,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 15:43:37,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 15:43:37,099 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2018-11-23 15:43:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:37,221 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 15:43:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 15:43:37,221 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-11-23 15:43:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:37,222 INFO L225 Difference]: With dead ends: 52 [2018-11-23 15:43:37,222 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 15:43:37,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 15:43:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 15:43:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 15:43:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 15:43:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 15:43:37,225 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-23 15:43:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:37,225 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 15:43:37,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 15:43:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 15:43:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 15:43:37,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:37,226 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:37,226 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:37,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-11-23 15:43:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:37,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:37,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 15:43:37,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:37,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:37,561 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:37,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:37,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:37,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:37,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:43:37,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:43:37,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 15:43:37,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:37,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 15:43:37,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 15:43:38,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:38,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-23 15:43:38,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:38,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 15:43:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 15:43:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 15:43:38,952 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2018-11-23 15:43:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:39,106 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 15:43:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 15:43:39,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-11-23 15:43:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:39,110 INFO L225 Difference]: With dead ends: 55 [2018-11-23 15:43:39,110 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 15:43:39,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 15:43:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 15:43:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 15:43:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 15:43:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 15:43:39,114 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-23 15:43:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:39,115 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 15:43:39,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 15:43:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 15:43:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 15:43:39,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:39,116 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:39,116 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:39,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-11-23 15:43:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:39,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:39,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 15:43:39,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:39,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:39,446 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:39,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:39,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:39,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:39,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:43:39,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:43:39,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:43:39,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:39,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 15:43:39,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 15:43:41,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:41,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-23 15:43:41,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 15:43:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 15:43:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 15:43:41,019 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 30 states. [2018-11-23 15:43:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:41,232 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 15:43:41,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 15:43:41,233 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-11-23 15:43:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:41,234 INFO L225 Difference]: With dead ends: 58 [2018-11-23 15:43:41,234 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 15:43:41,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 15:43:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 15:43:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 15:43:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 15:43:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 15:43:41,238 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-23 15:43:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:41,238 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 15:43:41,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 15:43:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 15:43:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 15:43:41,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:41,241 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:41,242 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:41,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-11-23 15:43:41,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:41,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:41,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 15:43:41,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:41,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:41,791 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:41,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:41,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:41,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:41,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:41,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:43:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:41,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 15:43:41,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 15:43:43,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-23 15:43:43,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:43,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 15:43:43,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 15:43:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=3185, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 15:43:43,441 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2018-11-23 15:43:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:43,627 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 15:43:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 15:43:43,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-11-23 15:43:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:43,628 INFO L225 Difference]: With dead ends: 61 [2018-11-23 15:43:43,628 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 15:43:43,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=475, Invalid=3185, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 15:43:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 15:43:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 15:43:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 15:43:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 15:43:43,632 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-23 15:43:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:43,632 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 15:43:43,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 15:43:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 15:43:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 15:43:43,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:43,634 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:43,634 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:43,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:43,634 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-11-23 15:43:43,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:43,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:43,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 15:43:44,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:44,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:44,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:44,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:44,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:44,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:44,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:43:44,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:43:44,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 15:43:44,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:44,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 15:43:44,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 15:43:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-23 15:43:46,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:46,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 15:43:46,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 15:43:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=3625, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 15:43:46,078 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2018-11-23 15:43:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:46,269 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 15:43:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 15:43:46,269 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-11-23 15:43:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:46,270 INFO L225 Difference]: With dead ends: 64 [2018-11-23 15:43:46,270 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 15:43:46,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=535, Invalid=3625, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 15:43:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 15:43:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 15:43:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 15:43:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 15:43:46,275 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-23 15:43:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:46,275 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 15:43:46,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 15:43:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 15:43:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 15:43:46,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:46,276 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:46,276 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:46,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-11-23 15:43:46,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:46,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:46,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 15:43:46,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:46,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:46,656 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:46,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:46,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:46,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:46,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:43:46,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:43:46,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:43:46,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:46,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 15:43:46,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 15:43:48,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-23 15:43:48,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:48,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 15:43:48,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 15:43:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2018-11-23 15:43:48,637 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 36 states. [2018-11-23 15:43:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:48,861 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-23 15:43:48,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 15:43:48,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-11-23 15:43:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:48,862 INFO L225 Difference]: With dead ends: 67 [2018-11-23 15:43:48,862 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 15:43:48,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2018-11-23 15:43:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 15:43:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 15:43:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 15:43:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 15:43:48,867 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-11-23 15:43:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:48,868 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 15:43:48,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 15:43:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 15:43:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 15:43:48,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:48,868 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:48,869 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:48,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:48,869 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2018-11-23 15:43:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:48,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:48,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 15:43:49,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:49,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:49,332 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:49,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:49,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:49,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:49,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:49,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:43:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:49,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 15:43:49,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 15:43:51,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:51,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-23 15:43:51,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:51,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 15:43:51,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 15:43:51,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=4589, Unknown=0, NotChecked=0, Total=5256 [2018-11-23 15:43:51,593 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 38 states. [2018-11-23 15:43:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:51,838 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 15:43:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 15:43:51,839 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-11-23 15:43:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:51,839 INFO L225 Difference]: With dead ends: 70 [2018-11-23 15:43:51,840 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 15:43:51,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=667, Invalid=4589, Unknown=0, NotChecked=0, Total=5256 [2018-11-23 15:43:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 15:43:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 15:43:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 15:43:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-23 15:43:51,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-11-23 15:43:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:51,843 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-23 15:43:51,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 15:43:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-23 15:43:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 15:43:51,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:51,844 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:51,844 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:51,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2018-11-23 15:43:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:51,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:43:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:51,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 15:43:52,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:52,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:52,515 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:52,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:52,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:52,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:43:52,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 15:43:54,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 15:43:54,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:54,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 15:43:54,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:43:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 15:43:56,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:43:56,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-23 15:43:56,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:43:56,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 15:43:56,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 15:43:56,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=5113, Unknown=0, NotChecked=0, Total=5852 [2018-11-23 15:43:56,590 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2018-11-23 15:43:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:43:57,015 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 15:43:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 15:43:57,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-11-23 15:43:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:43:57,017 INFO L225 Difference]: With dead ends: 73 [2018-11-23 15:43:57,017 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 15:43:57,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=739, Invalid=5113, Unknown=0, NotChecked=0, Total=5852 [2018-11-23 15:43:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 15:43:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 15:43:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 15:43:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 15:43:57,021 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-11-23 15:43:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:43:57,021 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 15:43:57,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 15:43:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 15:43:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 15:43:57,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:43:57,031 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:43:57,031 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:43:57,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:43:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2018-11-23 15:43:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:43:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:57,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:43:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:43:57,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:43:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:43:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 15:43:57,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:57,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:43:57,589 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:43:57,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:43:57,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:43:57,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:43:57,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:43:57,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 15:43:57,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:43:57,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:43:57,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:43:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 15:43:57,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:44:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 15:44:00,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:44:00,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-23 15:44:00,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:44:00,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 15:44:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 15:44:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=815, Invalid=5665, Unknown=0, NotChecked=0, Total=6480 [2018-11-23 15:44:00,261 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 42 states. [2018-11-23 15:44:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:44:00,585 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-23 15:44:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 15:44:00,586 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-11-23 15:44:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:44:00,586 INFO L225 Difference]: With dead ends: 76 [2018-11-23 15:44:00,586 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 15:44:00,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=815, Invalid=5665, Unknown=0, NotChecked=0, Total=6480 [2018-11-23 15:44:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 15:44:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 15:44:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 15:44:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-23 15:44:00,590 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-11-23 15:44:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:44:00,590 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-23 15:44:00,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 15:44:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-23 15:44:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 15:44:00,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:44:00,591 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:44:00,592 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:44:00,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2018-11-23 15:44:00,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:44:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:00,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:44:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:00,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:44:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 15:44:01,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:44:01,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:44:01,156 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 15:44:01,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 15:44:01,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:44:01,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:44:01,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:01,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:44:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:44:01,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:44:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 15:44:01,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:44:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 15:44:04,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:44:04,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-23 15:44:04,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:44:04,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 15:44:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 15:44:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=6245, Unknown=0, NotChecked=0, Total=7140 [2018-11-23 15:44:04,103 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 44 states. [2018-11-23 15:44:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:44:04,437 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-23 15:44:04,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 15:44:04,437 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2018-11-23 15:44:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:44:04,438 INFO L225 Difference]: With dead ends: 79 [2018-11-23 15:44:04,438 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 15:44:04,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=895, Invalid=6245, Unknown=0, NotChecked=0, Total=7140 [2018-11-23 15:44:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 15:44:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 15:44:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 15:44:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-23 15:44:04,442 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-11-23 15:44:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:44:04,443 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-23 15:44:04,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 15:44:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-23 15:44:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 15:44:04,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:44:04,444 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:44:04,444 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:44:04,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:44:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2018-11-23 15:44:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:44:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:44:04,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:44:04,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:44:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:44:04,600 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967316] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967316] [?] ~x := #in~x; VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967315] [?] ~x := #in~x; VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967314] [?] ~x := #in~x; VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967313] [?] ~x := #in~x; VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967312] [?] ~x := #in~x; VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967311] [?] ~x := #in~x; VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967310] [?] ~x := #in~x; VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967309] [?] ~x := #in~x; VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967308] [?] ~x := #in~x; VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967307] [?] ~x := #in~x; VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967306] [?] ~x := #in~x; VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967305] [?] ~x := #in~x; VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967304] [?] ~x := #in~x; VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967303] [?] ~x := #in~x; VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967302] [?] ~x := #in~x; VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967301] [?] ~x := #in~x; VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967300] [?] ~x := #in~x; VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] assume true; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] RET #32#return; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] assume true; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] RET #32#return; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] assume true; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] RET #32#return; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] assume true; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] RET #32#return; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] assume true; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] RET #32#return; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] assume true; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] RET #32#return; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] assume true; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] RET #32#return; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#t~ret0|=10] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] assume true; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] RET #32#return; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#t~ret0|=11] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] assume true; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] RET #32#return; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#t~ret0|=12] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] assume true; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] RET #32#return; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#t~ret0|=13] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] assume true; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] RET #32#return; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#t~ret0|=14] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] assume true; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] RET #32#return; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#t~ret0|=15] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] assume true; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] RET #32#return; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#t~ret0|=16] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] assume true; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] RET #32#return; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#t~ret0|=17] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] assume true; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] RET #32#return; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#t~ret0|=18] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] assume true; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] RET #32#return; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#t~ret0|=19] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] assume true; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=4294967316, |main_#t~ret2|=20] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume 20 == ~result~0 % 4294967296; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume !false; VAL [main_~input~0=4294967316, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- 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] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] ----- [2018-11-23 15:44:04,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:44:04 BoogieIcfgContainer [2018-11-23 15:44:04,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:44:04,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:44:04,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:44:04,807 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:44:04,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:28" (3/4) ... [2018-11-23 15:44:04,809 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 #26#return; [?] CALL call #t~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967316] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967316] [?] ~x := #in~x; VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967316, |id_#in~x|=4294967316] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967315] [?] ~x := #in~x; VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967315, |id_#in~x|=4294967315] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967314] [?] ~x := #in~x; VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967314, |id_#in~x|=4294967314] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967313] [?] ~x := #in~x; VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967313, |id_#in~x|=4294967313] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967312] [?] ~x := #in~x; VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967312, |id_#in~x|=4294967312] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967311] [?] ~x := #in~x; VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967311, |id_#in~x|=4294967311] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967310] [?] ~x := #in~x; VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967310, |id_#in~x|=4294967310] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967309] [?] ~x := #in~x; VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967309, |id_#in~x|=4294967309] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967308] [?] ~x := #in~x; VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967308, |id_#in~x|=4294967308] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967307] [?] ~x := #in~x; VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967307, |id_#in~x|=4294967307] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967306] [?] ~x := #in~x; VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967306, |id_#in~x|=4294967306] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967305] [?] ~x := #in~x; VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967305, |id_#in~x|=4294967305] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967304] [?] ~x := #in~x; VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967304, |id_#in~x|=4294967304] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967303] [?] ~x := #in~x; VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967303, |id_#in~x|=4294967303] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967302] [?] ~x := #in~x; VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967302, |id_#in~x|=4294967302] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967301] [?] ~x := #in~x; VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967301, |id_#in~x|=4294967301] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967300] [?] ~x := #in~x; VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967300, |id_#in~x|=4294967300] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] assume true; VAL [id_~x=4294967300, |id_#in~x|=4294967300, |id_#res|=4] [?] RET #32#return; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] assume true; VAL [id_~x=4294967301, |id_#in~x|=4294967301, |id_#res|=5] [?] RET #32#return; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] assume true; VAL [id_~x=4294967302, |id_#in~x|=4294967302, |id_#res|=6] [?] RET #32#return; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] assume true; VAL [id_~x=4294967303, |id_#in~x|=4294967303, |id_#res|=7] [?] RET #32#return; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] assume true; VAL [id_~x=4294967304, |id_#in~x|=4294967304, |id_#res|=8] [?] RET #32#return; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] assume true; VAL [id_~x=4294967305, |id_#in~x|=4294967305, |id_#res|=9] [?] RET #32#return; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] assume true; VAL [id_~x=4294967306, |id_#in~x|=4294967306, |id_#res|=10] [?] RET #32#return; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#t~ret0|=10] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] assume true; VAL [id_~x=4294967307, |id_#in~x|=4294967307, |id_#res|=11] [?] RET #32#return; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#t~ret0|=11] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] assume true; VAL [id_~x=4294967308, |id_#in~x|=4294967308, |id_#res|=12] [?] RET #32#return; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#t~ret0|=12] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] assume true; VAL [id_~x=4294967309, |id_#in~x|=4294967309, |id_#res|=13] [?] RET #32#return; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#t~ret0|=13] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] assume true; VAL [id_~x=4294967310, |id_#in~x|=4294967310, |id_#res|=14] [?] RET #32#return; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#t~ret0|=14] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] assume true; VAL [id_~x=4294967311, |id_#in~x|=4294967311, |id_#res|=15] [?] RET #32#return; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#t~ret0|=15] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] assume true; VAL [id_~x=4294967312, |id_#in~x|=4294967312, |id_#res|=16] [?] RET #32#return; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#t~ret0|=16] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] assume true; VAL [id_~x=4294967313, |id_#in~x|=4294967313, |id_#res|=17] [?] RET #32#return; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#t~ret0|=17] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] assume true; VAL [id_~x=4294967314, |id_#in~x|=4294967314, |id_#res|=18] [?] RET #32#return; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#t~ret0|=18] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] assume true; VAL [id_~x=4294967315, |id_#in~x|=4294967315, |id_#res|=19] [?] RET #32#return; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#t~ret0|=19] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] assume true; VAL [id_~x=4294967316, |id_#in~x|=4294967316, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=4294967316, |main_#t~ret2|=20] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume 20 == ~result~0 % 4294967296; VAL [main_~input~0=4294967316, main_~result~0=20] [?] assume !false; VAL [main_~input~0=4294967316, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- 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] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L4-L7] ensures true; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L4-L7] ensures true; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L4-L7] ensures true; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L4-L7] ensures true; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L4-L7] ensures true; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L4-L7] ensures true; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L4-L7] ensures true; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L4-L7] ensures true; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L4-L7] ensures true; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L4-L7] ensures true; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L4-L7] ensures true; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L4-L7] ensures true; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L4-L7] ensures true; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L4-L7] ensures true; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L4-L7] ensures true; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L4-L7] ensures true; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L4-L7] ensures true; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12-L14] assume 20 == ~result~0 % 4294967296; VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967316] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967316] [L4-L7] ~x := #in~x; VAL [#in~x=4294967316, ~x=4294967316] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967316, ~x=4294967316] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315] [L4-L7] ~x := #in~x; VAL [#in~x=4294967315, ~x=4294967315] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967315, ~x=4294967315] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314] [L4-L7] ~x := #in~x; VAL [#in~x=4294967314, ~x=4294967314] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967314, ~x=4294967314] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313] [L4-L7] ~x := #in~x; VAL [#in~x=4294967313, ~x=4294967313] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967313, ~x=4294967313] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312] [L4-L7] ~x := #in~x; VAL [#in~x=4294967312, ~x=4294967312] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967312, ~x=4294967312] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311] [L4-L7] ~x := #in~x; VAL [#in~x=4294967311, ~x=4294967311] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967311, ~x=4294967311] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310] [L4-L7] ~x := #in~x; VAL [#in~x=4294967310, ~x=4294967310] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967310, ~x=4294967310] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309] [L4-L7] ~x := #in~x; VAL [#in~x=4294967309, ~x=4294967309] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967309, ~x=4294967309] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308] [L4-L7] ~x := #in~x; VAL [#in~x=4294967308, ~x=4294967308] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967308, ~x=4294967308] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307] [L4-L7] ~x := #in~x; VAL [#in~x=4294967307, ~x=4294967307] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967307, ~x=4294967307] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306] [L4-L7] ~x := #in~x; VAL [#in~x=4294967306, ~x=4294967306] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967306, ~x=4294967306] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305] [L4-L7] ~x := #in~x; VAL [#in~x=4294967305, ~x=4294967305] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967305, ~x=4294967305] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304] [L4-L7] ~x := #in~x; VAL [#in~x=4294967304, ~x=4294967304] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967304, ~x=4294967304] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303] [L4-L7] ~x := #in~x; VAL [#in~x=4294967303, ~x=4294967303] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967303, ~x=4294967303] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302] [L4-L7] ~x := #in~x; VAL [#in~x=4294967302, ~x=4294967302] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967302, ~x=4294967302] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301] [L4-L7] ~x := #in~x; VAL [#in~x=4294967301, ~x=4294967301] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967301, ~x=4294967301] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300] [L4-L7] ~x := #in~x; VAL [#in~x=4294967300, ~x=4294967300] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967300, ~x=4294967300] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967300, #t~ret0=3, ~x=4294967300] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967300, #res=4, ~x=4294967300] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967301, #t~ret0=4, ~x=4294967301] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967301, #res=5, ~x=4294967301] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967302, #t~ret0=5, ~x=4294967302] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967302, #res=6, ~x=4294967302] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967303, #t~ret0=6, ~x=4294967303] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967303, #res=7, ~x=4294967303] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967304, #t~ret0=7, ~x=4294967304] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967304, #res=8, ~x=4294967304] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967305, #t~ret0=8, ~x=4294967305] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967305, #res=9, ~x=4294967305] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967306, #t~ret0=9, ~x=4294967306] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967306, #res=10, ~x=4294967306] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967307, #t~ret0=10, ~x=4294967307] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967307, #res=11, ~x=4294967307] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967308, #t~ret0=11, ~x=4294967308] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967308, #res=12, ~x=4294967308] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967309, #t~ret0=12, ~x=4294967309] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967309, #res=13, ~x=4294967309] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967310, #t~ret0=13, ~x=4294967310] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967310, #res=14, ~x=4294967310] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967311, #t~ret0=14, ~x=4294967311] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967311, #res=15, ~x=4294967311] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967312, #t~ret0=15, ~x=4294967312] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967312, #res=16, ~x=4294967312] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967313, #t~ret0=16, ~x=4294967313] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967313, #res=17, ~x=4294967313] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967314, #t~ret0=17, ~x=4294967314] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967314, #res=18, ~x=4294967314] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967315, #t~ret0=18, ~x=4294967315] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967315, #res=19, ~x=4294967315] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967316, #t~ret0=19, ~x=4294967316] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967316, #res=20, ~x=4294967316] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=20, ~input~0=4294967316] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967316, ~result~0=20] [L12] COND TRUE 20 == ~result~0 % 4294967296 VAL [~input~0=4294967316, ~result~0=20] [L13] assert false; VAL [~input~0=4294967316, ~result~0=20] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] ----- [2018-11-23 15:44:05,361 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3cce29d3-3012-482c-97ed-adb4cd2fa793/bin-2019/utaipan/witness.graphml [2018-11-23 15:44:05,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:44:05,361 INFO L168 Benchmark]: Toolchain (without parser) took 36886.38 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.3 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -362.7 MB). Peak memory consumption was 194.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:05,362 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:44:05,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.25 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:05,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:44:05,363 INFO L168 Benchmark]: Boogie Preprocessor took 10.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:05,363 INFO L168 Benchmark]: RCFGBuilder took 165.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:05,363 INFO L168 Benchmark]: TraceAbstraction took 35991.69 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 424.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.7 MB). Peak memory consumption was 225.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:44:05,363 INFO L168 Benchmark]: Witness Printer took 554.15 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-23 15:44:05,365 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.25 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 165.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35991.69 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 424.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.7 MB). Peak memory consumption was 225.0 MB. Max. memory is 11.5 GB. * Witness Printer took 554.15 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 35.9s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 684 SDtfs, 2 SDslu, 14848 SDs, 0 SdLazy, 8769 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3235 GetRequests, 2320 SyntacticMatches, 19 SemanticMatches, 896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5788 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 4116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1430724 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2850 ConjunctsInSsa, 912 ConjunctsInUnsatCore, 58 InterpolantComputations, 1 PerfectInterpolantSequences, 11400/22800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...