./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d29117e01c2d68b456be2ae55b4c10d8b73c290 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:40:14,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:40:14,576 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:40:14,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:40:14,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:40:14,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:40:14,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:40:14,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:40:14,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:40:14,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:40:14,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:40:14,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:40:14,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:40:14,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:40:14,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:40:14,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:40:14,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:40:14,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:40:14,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:40:14,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:40:14,598 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:40:14,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:40:14,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:40:14,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:40:14,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:40:14,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:40:14,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:40:14,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:40:14,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:40:14,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:40:14,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:40:14,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:40:14,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:40:14,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:40:14,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:40:14,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:40:14,606 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 14:40:14,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:40:14,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:40:14,617 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:40:14,617 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 14:40:14,618 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:40:14,618 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:40:14,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:40:14,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:40:14,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:40:14,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:40:14,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:40:14,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:40:14,619 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:40:14,620 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:40:14,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:40:14,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:40:14,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:40:14,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:40:14,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:40:14,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:40:14,620 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 14:40:14,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:40:14,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:40:14,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d29117e01c2d68b456be2ae55b4c10d8b73c290 [2018-11-23 14:40:14,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:40:14,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:40:14,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:40:14,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:40:14,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:40:14,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/../../sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-23 14:40:14,701 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/data/2d1899be0/18db059b3ca442678724d86541d81441/FLAG264efc3fe [2018-11-23 14:40:15,021 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:40:15,022 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/sv-benchmarks/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-23 14:40:15,025 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/data/2d1899be0/18db059b3ca442678724d86541d81441/FLAG264efc3fe [2018-11-23 14:40:15,457 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/data/2d1899be0/18db059b3ca442678724d86541d81441 [2018-11-23 14:40:15,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:40:15,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:40:15,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:15,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:40:15,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:40:15,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737ce175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15, skipping insertion in model container [2018-11-23 14:40:15,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:40:15,484 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:40:15,577 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:15,579 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:40:15,587 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:15,594 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:40:15,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15 WrapperNode [2018-11-23 14:40:15,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:15,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:15,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:40:15,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:40:15,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:15,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:40:15,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:40:15,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:40:15,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:40:15,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:40:15,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:40:15,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:40:15,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:40:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:40:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:40:15,821 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:40:15,821 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 14:40:15,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:15 BoogieIcfgContainer [2018-11-23 14:40:15,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:40:15,822 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:40:15,822 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:40:15,829 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:40:15,830 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:15" (1/1) ... [2018-11-23 14:40:15,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 14:40:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 14:40:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 14:40:15,861 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:15,979 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 14:40:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-11-23 14:40:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-11-23 14:40:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 14:40:15,999 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-23 14:40:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-23 14:40:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 14:40:16,130 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-11-23 14:40:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-11-23 14:40:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:40:16,278 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 14:40:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 14:40:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 14:40:16,393 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 14:40:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 14:40:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:40:16,531 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:40:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 14:40:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 14:40:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:40:16,679 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:40:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:16,731 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 7 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0;main_~y~0 := 1; VAL [ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=1] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=2] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=4] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=3, ULTIMATE.start_main_~y~0=8] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=16] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=5, ULTIMATE.start_main_~y~0=32] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~x~0 % 4294967296 < 6);}EndParallelComposition__VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] assume !(main_~x~0 % 4294967296 < 6); [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3-L5] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] assume !(main_~x~0 % 4294967296 < 6); [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3-L5] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] COND TRUE !(main_~x~0 % 4294967296 < 6) [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] COND TRUE !(main_~x~0 % 4294967296 < 6) [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L9] ~x~0 := 0; [L10] ~y~0 := 1; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) [L2-L7] ~cond := #in~cond; [L3] COND TRUE 0 == ~cond [L4] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9] ~x~0 := 0; [L10] ~y~0 := 1; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) [L2-L7] ~cond := #in~cond; [L3] COND TRUE 0 == ~cond [L4] assert false; [L9] unsigned int x = 0; [L10] unsigned int y = 1; [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND FALSE !(x < 6) [L3] COND TRUE !(cond) [L4] __VERIFIER_error() ----- [2018-11-23 14:40:16,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:40:16 ImpRootNode [2018-11-23 14:40:16,758 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:40:16,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:40:16,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:40:16,758 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:40:16,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:15" (3/4) ... [2018-11-23 14:40:16,761 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0;main_~x~0 := 0;main_~y~0 := 1; VAL [ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=1] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=2] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=4] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=3, ULTIMATE.start_main_~y~0=8] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=16] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=5, ULTIMATE.start_main_~y~0=32] [?] assume !!(main_~x~0 % 4294967296 < 6);main_#t~post0 := main_~x~0;main_~x~0 := 1 + main_#t~post0;havoc main_#t~post0;main_~y~0 := 2 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~x~0 % 4294967296 < 6);}EndParallelComposition__VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=6, ULTIMATE.start_main_~y~0=64, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] assume !(main_~x~0 % 4294967296 < 6); [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3-L5] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] assume !!(main_~x~0 % 4294967296 < 6); [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] assume !(main_~x~0 % 4294967296 < 6); [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3-L5] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] COND TRUE !(main_~x~0 % 4294967296 < 6) [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~x~0, main_~y~0; [L9] main_~x~0 := 0; [L10] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L11-L14] COND FALSE !(!(main_~x~0 % 4294967296 < 6)) [L12] main_#t~post0 := main_~x~0; [L12] main_~x~0 := 1 + main_#t~post0; [L12] havoc main_#t~post0; [L13] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L11-L14] COND TRUE !(main_~x~0 % 4294967296 < 6) [L15] __VERIFIER_assert_#in~cond := (if 64 != main_~y~0 % 4294967296 then 1 else 0); [L15] havoc __VERIFIER_assert_~cond; [L2-L7] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L3] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L4] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L9] ~x~0 := 0; [L10] ~y~0 := 1; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) [L2-L7] ~cond := #in~cond; [L3] COND TRUE 0 == ~cond [L4] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9] ~x~0 := 0; [L10] ~y~0 := 1; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND FALSE !(!(~x~0 % 4294967296 < 6)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := 1 + #t~post0; [L12] havoc #t~post0; [L13] ~y~0 := 2 * ~y~0; [L11-L14] COND TRUE !(~x~0 % 4294967296 < 6) [L2-L7] ~cond := #in~cond; [L3] COND TRUE 0 == ~cond [L4] assert false; [L9] unsigned int x = 0; [L10] unsigned int y = 1; [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND FALSE !(x < 6) [L3] COND TRUE !(cond) [L4] __VERIFIER_error() ----- [2018-11-23 14:40:16,827 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_19ed9fd3-0350-476e-9f8d-9a430085fd6b/bin-2019/ukojak/witness.graphml [2018-11-23 14:40:16,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:40:16,828 INFO L168 Benchmark]: Toolchain (without parser) took 1368.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 959.1 MB in the beginning and 994.9 MB in the end (delta: -35.8 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:16,830 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:16,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:16,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:16,832 INFO L168 Benchmark]: Boogie Preprocessor took 10.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:16,832 INFO L168 Benchmark]: RCFGBuilder took 197.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:16,835 INFO L168 Benchmark]: CodeCheck took 936.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:16,835 INFO L168 Benchmark]: Witness Printer took 68.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:16,840 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 376 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 203 SyntacticMatches, 25 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 0/35 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 [L11] COND FALSE !(x < 6) [L3] COND TRUE !(cond) [L4] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 17.85 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * CodeCheck took 936.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. * Witness Printer took 68.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...