./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call.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_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/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 5a78e5ac8a70d10b48fa6c5955c8640de4def14b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:36:39,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:36:39,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:36:39,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:36:39,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:36:39,834 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:36:39,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:36:39,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:36:39,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:36:39,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:36:39,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:36:39,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:36:39,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:36:39,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:36:39,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:36:39,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:36:39,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:36:39,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:36:39,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:36:39,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:36:39,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:36:39,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:36:39,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:36:39,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:36:39,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:36:39,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:36:39,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:36:39,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:36:39,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:36:39,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:36:39,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:36:39,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:36:39,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:36:39,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:36:39,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:36:39,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:36:39,855 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 15:36:39,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:36:39,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:36:39,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:36:39,866 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 15:36:39,867 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:36:39,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:36:39,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:36:39,867 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:36:39,868 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:36:39,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:36:39,869 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:36:39,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:36:39,869 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 15:36:39,869 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 15:36:39,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:36:39,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:36:39,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 15:36:39,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:36:39,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:36:39,870 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:36:39,870 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 15:36:39,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:36:39,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:36:39,871 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_6cddd94c-14e9-4f54-9605-500653e60651/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 -> 5a78e5ac8a70d10b48fa6c5955c8640de4def14b [2018-11-23 15:36:39,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:36:39,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:36:39,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:36:39,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:36:39,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:36:39,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/../../sv-benchmarks/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-23 15:36:39,955 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/data/7a3dbec23/6795054e0b984801a2b673e05d7b72c9/FLAG7811acabc [2018-11-23 15:36:40,364 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:36:40,364 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/sv-benchmarks/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-23 15:36:40,368 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/data/7a3dbec23/6795054e0b984801a2b673e05d7b72c9/FLAG7811acabc [2018-11-23 15:36:40,378 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/data/7a3dbec23/6795054e0b984801a2b673e05d7b72c9 [2018-11-23 15:36:40,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:36:40,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:36:40,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:40,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:36:40,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:36:40,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e5f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40, skipping insertion in model container [2018-11-23 15:36:40,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:36:40,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:36:40,508 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:40,511 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:36:40,519 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:40,527 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:36:40,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40 WrapperNode [2018-11-23 15:36:40,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:40,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:40,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:36:40,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:36:40,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:40,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:36:40,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:36:40,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:36:40,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:36:40,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:36:40,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:36:40,557 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:36:40,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/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 15:36:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:36:40,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:36:40,719 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:36:40,719 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 15:36:40,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:40 BoogieIcfgContainer [2018-11-23 15:36:40,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:36:40,720 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 15:36:40,720 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 15:36:40,726 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 15:36:40,726 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:40" (1/1) ... [2018-11-23 15:36:40,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 15:36:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 6 states and 7 transitions. [2018-11-23 15:36:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-11-23 15:36:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 15:36:40,756 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 15:36:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 15:36:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 8 states and 11 transitions. [2018-11-23 15:36:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2018-11-23 15:36:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 15:36:40,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 15:36:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:40,982 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-23 15:36:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 15:36:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 10 states and 11 transitions. [2018-11-23 15:36:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-11-23 15:36:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 15:36:41,198 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 15:36:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:41,245 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 3 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post0, main_~i~0;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0] [?] assume !!(main_~i~0 < 5);main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;check_error_#in~b := (if 3 != main_~i~0 then 1 else 0);havoc check_error_~b;check_error_~b := check_error_#in~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=1, |ULTIMATE.start_check_error_#in~b|=1] [?] assume 0 != check_error_~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=1, |ULTIMATE.start_check_error_#in~b|=1] [?] assume !!(main_~i~0 < 5);main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;check_error_#in~b := (if 3 != main_~i~0 then 1 else 0);havoc check_error_~b;check_error_~b := check_error_#in~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=2, |ULTIMATE.start_check_error_#in~b|=1] [?] assume 0 != check_error_~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=2, |ULTIMATE.start_check_error_#in~b|=1] [?] assume !!(main_~i~0 < 5);main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;check_error_#in~b := (if 3 != main_~i~0 then 1 else 0);havoc check_error_~b;check_error_~b := check_error_#in~b; VAL [ULTIMATE.start_check_error_~b=0, ULTIMATE.start_main_~i~0=3, |ULTIMATE.start_check_error_#in~b|=0] [?] assume !(0 != check_error_~b); VAL [ULTIMATE.start_check_error_~b=0, ULTIMATE.start_main_~i~0=3, |ULTIMATE.start_check_error_#in~b|=0] [?] assume !false; VAL [ULTIMATE.start_check_error_~b=0, ULTIMATE.start_main_~i~0=3, |ULTIMATE.start_check_error_#in~b|=0] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] assume !(0 != check_error_~b); VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] assume !(0 != check_error_~b); VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] COND FALSE !(0 != check_error_~b) VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] COND FALSE !(0 != check_error_~b) VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L23] ~i~0 := 0; [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND FALSE !(0 != ~b) [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L23] ~i~0 := 0; [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND FALSE !(0 != ~b) [L6] assert false; [L23] int i=0; [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 15:36:41,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 03:36:41 ImpRootNode [2018-11-23 15:36:41,270 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 15:36:41,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:36:41,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:36:41,270 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:36:41,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:40" (3/4) ... [2018-11-23 15:36:41,273 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_~i~0;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0] [?] assume !!(main_~i~0 < 5);main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;check_error_#in~b := (if 3 != main_~i~0 then 1 else 0);havoc check_error_~b;check_error_~b := check_error_#in~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=1, |ULTIMATE.start_check_error_#in~b|=1] [?] assume 0 != check_error_~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=1, |ULTIMATE.start_check_error_#in~b|=1] [?] assume !!(main_~i~0 < 5);main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;check_error_#in~b := (if 3 != main_~i~0 then 1 else 0);havoc check_error_~b;check_error_~b := check_error_#in~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=2, |ULTIMATE.start_check_error_#in~b|=1] [?] assume 0 != check_error_~b; VAL [ULTIMATE.start_check_error_~b=1, ULTIMATE.start_main_~i~0=2, |ULTIMATE.start_check_error_#in~b|=1] [?] assume !!(main_~i~0 < 5);main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;check_error_#in~b := (if 3 != main_~i~0 then 1 else 0);havoc check_error_~b;check_error_~b := check_error_#in~b; VAL [ULTIMATE.start_check_error_~b=0, ULTIMATE.start_main_~i~0=3, |ULTIMATE.start_check_error_#in~b|=0] [?] assume !(0 != check_error_~b); VAL [ULTIMATE.start_check_error_~b=0, ULTIMATE.start_main_~i~0=3, |ULTIMATE.start_check_error_#in~b|=0] [?] assume !false; VAL [ULTIMATE.start_check_error_~b=0, ULTIMATE.start_main_~i~0=3, |ULTIMATE.start_check_error_#in~b|=0] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] assume !(0 != check_error_~b); VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] assume 0 != check_error_~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] assume !!(main_~i~0 < 5); [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] assume !(0 != check_error_~b); VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] COND FALSE !(0 != check_error_~b) VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0; [L23] main_~i~0 := 0; VAL [main_~i~0=0] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=1] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L18] COND TRUE 0 != check_error_~b VAL [check_error_#in~b=1, check_error_~b=1, main_~i~0=2] [L24-L31] COND FALSE !(!(main_~i~0 < 5)) [L25] main_#t~post0 := main_~i~0; [L25] main_~i~0 := 1 + main_#t~post0; [L25] havoc main_#t~post0; [L29] check_error_#in~b := (if 3 != main_~i~0 then 1 else 0); [L29] havoc check_error_~b; [L17-L19] check_error_~b := check_error_#in~b; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L18] COND FALSE !(0 != check_error_~b) VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L6] assert false; VAL [check_error_#in~b=0, check_error_~b=0, main_~i~0=3] [L23] ~i~0 := 0; [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND FALSE !(0 != ~b) [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L23] ~i~0 := 0; [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND TRUE 0 != ~b [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; [L17-L19] ~b := #in~b; [L18] COND FALSE !(0 != ~b) [L6] assert false; [L23] int i=0; [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 15:36:41,311 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6cddd94c-14e9-4f54-9605-500653e60651/bin-2019/ukojak/witness.graphml [2018-11-23 15:36:41,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:36:41,312 INFO L168 Benchmark]: Toolchain (without parser) took 931.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:41,314 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:41,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.33 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 15:36:41,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.55 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 15:36:41,315 INFO L168 Benchmark]: Boogie Preprocessor took 10.29 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 15:36:41,315 INFO L168 Benchmark]: RCFGBuilder took 162.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -221.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:41,316 INFO L168 Benchmark]: CodeCheck took 550.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:41,316 INFO L168 Benchmark]: Witness Printer took 41.46 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-23 15:36:41,318 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.5s OverallTime, 3 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 6 SDslu, 4 SDs, 0 SdLazy, 60 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 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: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] int i=0; [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L24] COND TRUE i<5 [L25] i++ [L18] (b) ? (0) : __blast_assert () [L6] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.33 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 18.55 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.29 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 162.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -221.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * CodeCheck took 550.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Witness Printer took 41.46 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...