./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6ff697c57265298ce2261966fa58c440777fc865 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:38:18,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:38:18,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:38:18,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:38:18,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:38:18,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:38:18,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:38:18,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:38:18,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:38:18,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:38:18,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:38:18,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:38:18,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:38:18,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:38:18,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:38:18,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:38:18,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:38:18,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:38:18,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:38:18,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:38:18,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:38:18,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:38:18,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:38:18,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:38:18,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:38:18,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:38:18,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:38:18,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:38:18,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:38:18,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:38:18,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:38:18,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:38:18,619 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:38:18,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:38:18,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:38:18,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:38:18,621 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-22 21:38:18,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:38:18,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:38:18,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:38:18,633 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-22 21:38:18,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:38:18,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:38:18,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:38:18,634 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:38:18,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:38:18,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:38:18,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:38:18,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:38:18,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:38:18,635 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-22 21:38:18,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:38:18,636 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:38:18,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:38:18,636 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 21:38:18,636 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 21:38:18,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:38:18,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:38:18,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 21:38:18,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:38:18,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:38:18,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:38:18,638 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-22 21:38:18,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:38:18,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:38:18,638 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_ddded665-61b7-4be9-a95f-02cee277e972/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ff697c57265298ce2261966fa58c440777fc865 [2018-11-22 21:38:18,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:38:18,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:38:18,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:38:18,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:38:18,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:38:18,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-22 21:38:18,730 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/data/f1ed013ca/a4e8d14b69da4bfbaa4e1739556fe56a/FLAG859fef7f2 [2018-11-22 21:38:19,050 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:38:19,050 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2_false-no-overflow.c [2018-11-22 21:38:19,056 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/data/f1ed013ca/a4e8d14b69da4bfbaa4e1739556fe56a/FLAG859fef7f2 [2018-11-22 21:38:19,066 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/data/f1ed013ca/a4e8d14b69da4bfbaa4e1739556fe56a [2018-11-22 21:38:19,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:38:19,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:38:19,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:38:19,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:38:19,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:38:19,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc0002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19, skipping insertion in model container [2018-11-22 21:38:19,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:38:19,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:38:19,240 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:38:19,243 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:38:19,257 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:38:19,267 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:38:19,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19 WrapperNode [2018-11-22 21:38:19,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:38:19,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:38:19,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:38:19,268 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:38:19,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:38:19,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:38:19,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:38:19,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:38:19,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:38:19,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:38:19,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:38:19,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:38:19,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:38:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/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-22 21:38:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-22 21:38:19,389 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-22 21:38:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:38:19,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:38:19,714 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:38:19,714 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 21:38:19,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:19 BoogieIcfgContainer [2018-11-22 21:38:19,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:38:19,715 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 21:38:19,715 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 21:38:19,722 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 21:38:19,722 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:19" (1/1) ... [2018-11-22 21:38:19,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:38:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 36 states and 45 transitions. [2018-11-22 21:38:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-11-22 21:38:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-22 21:38:19,757 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:19,839 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-22 21:38:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 35 states and 44 transitions. [2018-11-22 21:38:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2018-11-22 21:38:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-22 21:38:19,867 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:19,887 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-22 21:38:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 34 states and 43 transitions. [2018-11-22 21:38:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-22 21:38:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 21:38:19,938 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:19,958 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-22 21:38:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 45 states and 64 transitions. [2018-11-22 21:38:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2018-11-22 21:38:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:38:19,989 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,022 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-22 21:38:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 57 states and 90 transitions. [2018-11-22 21:38:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 90 transitions. [2018-11-22 21:38:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:38:20,151 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,169 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-22 21:38:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 69 states and 114 transitions. [2018-11-22 21:38:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 114 transitions. [2018-11-22 21:38:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:38:20,226 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,255 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-22 21:38:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 72 states and 123 transitions. [2018-11-22 21:38:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 123 transitions. [2018-11-22 21:38:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:38:20,363 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,382 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-22 21:38:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-11-22 21:38:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-22 21:38:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:38:20,399 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,428 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-22 21:38:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 68 states and 114 transitions. [2018-11-22 21:38:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 114 transitions. [2018-11-22 21:38:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:38:20,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,473 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-22 21:38:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 66 states and 110 transitions. [2018-11-22 21:38:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 110 transitions. [2018-11-22 21:38:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:38:20,496 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,514 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-22 21:38:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 64 states and 106 transitions. [2018-11-22 21:38:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-22 21:38:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:38:20,545 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,565 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-22 21:38:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 60 states and 99 transitions. [2018-11-22 21:38:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 99 transitions. [2018-11-22 21:38:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:38:20,597 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,627 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-22 21:38:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 64 states and 107 transitions. [2018-11-22 21:38:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 107 transitions. [2018-11-22 21:38:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:38:20,755 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,768 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-22 21:38:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 72 states and 123 transitions. [2018-11-22 21:38:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 123 transitions. [2018-11-22 21:38:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:38:20,837 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,862 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-22 21:38:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 82 states and 145 transitions. [2018-11-22 21:38:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 145 transitions. [2018-11-22 21:38:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:38:20,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:20,990 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-22 21:38:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 90 states and 160 transitions. [2018-11-22 21:38:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 160 transitions. [2018-11-22 21:38:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,075 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,091 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-22 21:38:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 92 states and 162 transitions. [2018-11-22 21:38:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 162 transitions. [2018-11-22 21:38:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,129 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-22 21:38:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 94 states and 164 transitions. [2018-11-22 21:38:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 164 transitions. [2018-11-22 21:38:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,169 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,185 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-22 21:38:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 96 states and 166 transitions. [2018-11-22 21:38:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 166 transitions. [2018-11-22 21:38:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,220 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-22 21:38:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 98 states and 168 transitions. [2018-11-22 21:38:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 168 transitions. [2018-11-22 21:38:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,255 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-22 21:38:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 100 states and 170 transitions. [2018-11-22 21:38:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 170 transitions. [2018-11-22 21:38:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,299 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,310 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-22 21:38:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 102 states and 172 transitions. [2018-11-22 21:38:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 172 transitions. [2018-11-22 21:38:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,327 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,337 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-22 21:38:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 104 states and 178 transitions. [2018-11-22 21:38:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 178 transitions. [2018-11-22 21:38:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,351 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,362 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-22 21:38:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 106 states and 180 transitions. [2018-11-22 21:38:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 180 transitions. [2018-11-22 21:38:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:38:21,386 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:38:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 109 states and 194 transitions. [2018-11-22 21:38:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 194 transitions. [2018-11-22 21:38:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:38:21,720 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,757 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-22 21:38:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 109 states and 193 transitions. [2018-11-22 21:38:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 193 transitions. [2018-11-22 21:38:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,794 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:38:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 21:38:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 21:38:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 111 states and 194 transitions. [2018-11-22 21:38:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-11-22 21:38:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:38:21,930 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 21:38:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:38:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:38:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:38:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:38:21,982 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 27 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0;main_~d~0 := 1;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~x~0 := main_#t~nondet8;havoc main_#t~nondet8;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=1, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet9|=(- 1)] [?] assume 0 != main_#t~nondet9;havoc main_#t~nondet9; VAL [ULTIMATE.start_main_~d~0=1, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=1, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 >= -2147483648;main_~d~0 := main_~d~0 - 1; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet10|=0] [?] assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet12|=0] [?] assume !(0 != main_#t~nondet12);havoc main_#t~nondet12; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet14|=0] [?] assume !(0 != main_#t~nondet14);havoc main_#t~nondet14; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet16|=0] [?] assume !(0 != main_#t~nondet16);havoc main_#t~nondet16; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet18|=(- 1)] [?] assume 0 != main_#t~nondet18;havoc main_#t~nondet18; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 >= -2147483648;main_~d~0 := main_~d~0 - 1; VAL [ULTIMATE.start_main_~d~0=(- 1), ULTIMATE.start_main_~x~0=2147483647] [?] assume !!(main_~x~0 > 0); VAL [ULTIMATE.start_main_~d~0=(- 1), ULTIMATE.start_main_~x~0=2147483647] [?] assume !(main_~x~0 - main_~d~0 <= 2147483647); VAL [ULTIMATE.start_main_~d~0=(- 1), ULTIMATE.start_main_~x~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] assume 0 != main_#t~nondet9; [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] assume !(0 != main_#t~nondet10); [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] assume !(0 != main_#t~nondet12); [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] assume !(0 != main_#t~nondet14); [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] assume !(0 != main_#t~nondet16); [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] assume 0 != main_#t~nondet18; [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] assume !!(main_~x~0 > 0); VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] assume 0 != main_#t~nondet9; [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] assume !(0 != main_#t~nondet10); [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] assume !(0 != main_#t~nondet12); [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] assume !(0 != main_#t~nondet14); [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] assume !(0 != main_#t~nondet16); [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] assume 0 != main_#t~nondet18; [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] assume !!(main_~x~0 > 0); VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] COND TRUE 0 != main_#t~nondet9 [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] COND FALSE !(0 != main_#t~nondet10) [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] COND FALSE !(0 != main_#t~nondet12) [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] COND FALSE !(0 != main_#t~nondet14) [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] COND FALSE !(0 != main_#t~nondet16) [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] COND TRUE 0 != main_#t~nondet18 [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] COND FALSE !(!(main_~x~0 > 0)) VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] COND TRUE 0 != main_#t~nondet9 [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] COND FALSE !(0 != main_#t~nondet10) [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] COND FALSE !(0 != main_#t~nondet12) [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] COND FALSE !(0 != main_#t~nondet14) [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] COND FALSE !(0 != main_#t~nondet16) [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] COND TRUE 0 != main_#t~nondet18 [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] COND FALSE !(!(main_~x~0 > 0)) VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; [L57] assert ~d~0 - 1 <= 2147483647; [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; [L77] assert ~d~0 - 1 <= 2147483647; [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; [L80-L82] COND FALSE !(!(~x~0 > 0)) [L81] assert ~x~0 - ~d~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; [L57] assert ~d~0 - 1 <= 2147483647; [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; [L77] assert ~d~0 - 1 <= 2147483647; [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; [L80-L82] COND FALSE !(!(~x~0 > 0)) [L81] assert ~x~0 - ~d~0 <= 2147483647; [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 [L80] COND TRUE x > 0 [L81] x - d ----- [2018-11-22 21:38:22,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 09:38:22 ImpRootNode [2018-11-22 21:38:22,017 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-22 21:38:22,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:38:22,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:38:22,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:38:22,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:38:19" (3/4) ... [2018-11-22 21:38:22,021 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0;main_~d~0 := 1;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~x~0 := main_#t~nondet8;havoc main_#t~nondet8;assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=1, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet9|=(- 1)] [?] assume 0 != main_#t~nondet9;havoc main_#t~nondet9; VAL [ULTIMATE.start_main_~d~0=1, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=1, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 >= -2147483648;main_~d~0 := main_~d~0 - 1; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet10|=0] [?] assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet12|=0] [?] assume !(0 != main_#t~nondet12);havoc main_#t~nondet12; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet14|=0] [?] assume !(0 != main_#t~nondet14);havoc main_#t~nondet14; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet16|=0] [?] assume !(0 != main_#t~nondet16);havoc main_#t~nondet16; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647, |ULTIMATE.start_main_#t~nondet18|=(- 1)] [?] assume 0 != main_#t~nondet18;havoc main_#t~nondet18; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~d~0=0, ULTIMATE.start_main_~x~0=2147483647] [?] assume main_~d~0 - 1 >= -2147483648;main_~d~0 := main_~d~0 - 1; VAL [ULTIMATE.start_main_~d~0=(- 1), ULTIMATE.start_main_~x~0=2147483647] [?] assume !!(main_~x~0 > 0); VAL [ULTIMATE.start_main_~d~0=(- 1), ULTIMATE.start_main_~x~0=2147483647] [?] assume !(main_~x~0 - main_~d~0 <= 2147483647); VAL [ULTIMATE.start_main_~d~0=(- 1), ULTIMATE.start_main_~x~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] assume 0 != main_#t~nondet9; [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] assume !(0 != main_#t~nondet10); [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] assume !(0 != main_#t~nondet12); [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] assume !(0 != main_#t~nondet14); [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] assume !(0 != main_#t~nondet16); [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] assume 0 != main_#t~nondet18; [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] assume !!(main_~x~0 > 0); VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] assume 0 != main_#t~nondet9; [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] assume !(0 != main_#t~nondet10); [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] assume !(0 != main_#t~nondet12); [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] assume !(0 != main_#t~nondet14); [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] assume !(0 != main_#t~nondet16); [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] assume 0 != main_#t~nondet18; [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] assume !!(main_~x~0 > 0); VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] COND TRUE 0 != main_#t~nondet9 [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] COND FALSE !(0 != main_#t~nondet10) [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] COND FALSE !(0 != main_#t~nondet12) [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] COND FALSE !(0 != main_#t~nondet14) [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] COND FALSE !(0 != main_#t~nondet16) [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] COND TRUE 0 != main_#t~nondet18 [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] COND FALSE !(!(main_~x~0 > 0)) VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~ret11, main_#t~nondet12, main_#t~ret13, main_#t~nondet14, main_#t~ret15, main_#t~nondet16, main_#t~ret17, main_#t~nondet18, main_~d~0, main_~x~0; [L53] main_~d~0 := 1; [L54] assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; [L54] main_~x~0 := main_#t~nondet8; [L54] havoc main_#t~nondet8; [L56] assume -2147483648 <= main_#t~nondet9 && main_#t~nondet9 <= 2147483647; VAL [main_#t~nondet9=-1, main_~d~0=1, main_~x~0=2147483647] [L56-L58] COND TRUE 0 != main_#t~nondet9 [L56] havoc main_#t~nondet9; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=1, main_~x~0=2147483647] [L57] assert main_~d~0 - 1 >= -2147483648; [L57] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=0, main_~x~0=2147483647] [L61] assume -2147483648 <= main_#t~nondet10 && main_#t~nondet10 <= 2147483647; VAL [main_#t~nondet10=0, main_~d~0=0, main_~x~0=2147483647] [L61-L63] COND FALSE !(0 != main_#t~nondet10) [L61] havoc main_#t~nondet10; VAL [main_~d~0=0, main_~x~0=2147483647] [L64] assume -2147483648 <= main_#t~nondet12 && main_#t~nondet12 <= 2147483647; VAL [main_#t~nondet12=0, main_~d~0=0, main_~x~0=2147483647] [L64-L66] COND FALSE !(0 != main_#t~nondet12) [L64] havoc main_#t~nondet12; VAL [main_~d~0=0, main_~x~0=2147483647] [L67] assume -2147483648 <= main_#t~nondet14 && main_#t~nondet14 <= 2147483647; VAL [main_#t~nondet14=0, main_~d~0=0, main_~x~0=2147483647] [L67-L69] COND FALSE !(0 != main_#t~nondet14) [L67] havoc main_#t~nondet14; VAL [main_~d~0=0, main_~x~0=2147483647] [L70] assume -2147483648 <= main_#t~nondet16 && main_#t~nondet16 <= 2147483647; VAL [main_#t~nondet16=0, main_~d~0=0, main_~x~0=2147483647] [L70-L72] COND FALSE !(0 != main_#t~nondet16) [L70] havoc main_#t~nondet16; VAL [main_~d~0=0, main_~x~0=2147483647] [L76] assume -2147483648 <= main_#t~nondet18 && main_#t~nondet18 <= 2147483647; VAL [main_#t~nondet18=-1, main_~d~0=0, main_~x~0=2147483647] [L76-L78] COND TRUE 0 != main_#t~nondet18 [L76] havoc main_#t~nondet18; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 <= 2147483647; VAL [main_~d~0=0, main_~x~0=2147483647] [L77] assert main_~d~0 - 1 >= -2147483648; [L77] main_~d~0 := main_~d~0 - 1; VAL [main_~d~0=-1, main_~x~0=2147483647] [L80-L82] COND FALSE !(!(main_~x~0 > 0)) VAL [main_~d~0=-1, main_~x~0=2147483647] [L81] assert main_~x~0 - main_~d~0 <= 2147483647; VAL [main_~d~0=-1, main_~x~0=2147483647] [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; [L57] assert ~d~0 - 1 <= 2147483647; [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; [L77] assert ~d~0 - 1 <= 2147483647; [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; [L80-L82] COND FALSE !(!(~x~0 > 0)) [L81] assert ~x~0 - ~d~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L53] ~d~0 := 1; [L54] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; [L54] ~x~0 := #t~nondet8; [L54] havoc #t~nondet8; [L56] assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; [L56-L58] COND TRUE 0 != #t~nondet9 [L56] havoc #t~nondet9; [L57] assert ~d~0 - 1 <= 2147483647; [L57] assert ~d~0 - 1 >= -2147483648; [L57] ~d~0 := ~d~0 - 1; [L61] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L61-L63] COND FALSE !(0 != #t~nondet10) [L61] havoc #t~nondet10; [L64] assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; [L64-L66] COND FALSE !(0 != #t~nondet12) [L64] havoc #t~nondet12; [L67] assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647; [L67-L69] COND FALSE !(0 != #t~nondet14) [L67] havoc #t~nondet14; [L70] assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; [L70-L72] COND FALSE !(0 != #t~nondet16) [L70] havoc #t~nondet16; [L76] assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; [L76-L78] COND TRUE 0 != #t~nondet18 [L76] havoc #t~nondet18; [L77] assert ~d~0 - 1 <= 2147483647; [L77] assert ~d~0 - 1 >= -2147483648; [L77] ~d~0 := ~d~0 - 1; [L80-L82] COND FALSE !(!(~x~0 > 0)) [L81] assert ~x~0 - ~d~0 <= 2147483647; [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 [L80] COND TRUE x > 0 [L81] x - d ----- [2018-11-22 21:38:22,102 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ddded665-61b7-4be9-a95f-02cee277e972/bin-2019/ukojak/witness.graphml [2018-11-22 21:38:22,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:38:22,103 INFO L168 Benchmark]: Toolchain (without parser) took 3033.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:38:22,104 INFO L168 Benchmark]: CDTParser took 0.15 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-22 21:38:22,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.46 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:38:22,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:38:22,106 INFO L168 Benchmark]: Boogie Preprocessor took 14.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:38:22,106 INFO L168 Benchmark]: RCFGBuilder took 409.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:38:22,107 INFO L168 Benchmark]: CodeCheck took 2302.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.3 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:38:22,108 INFO L168 Benchmark]: Witness Printer took 84.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:38:22,115 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 2 procedures, 48 locations, 6 error locations. UNSAFE Result, 2.2s OverallTime, 27 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 829693920 SDtfs, 950386466 SDslu, 1450663944 SDs, 0 SdLazy, 803229932 SolverSat, 202665982 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4110 GetRequests, 3792 SyntacticMatches, 246 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 21274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 24 PerfectInterpolantSequences, 1/5 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: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 [L80] COND TRUE x > 0 [L81] x - d * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 196.46 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * CodeCheck took 2302.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.3 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...