java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/KojakBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 04:00:13,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 04:00:13,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 04:00:13,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 04:00:13,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 04:00:13,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 04:00:13,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 04:00:13,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 04:00:13,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 04:00:13,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 04:00:13,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 04:00:13,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 04:00:13,635 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 04:00:13,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 04:00:13,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 04:00:13,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 04:00:13,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 04:00:13,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 04:00:13,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 04:00:13,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 04:00:13,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 04:00:13,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 04:00:13,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 04:00:13,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 04:00:13,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 04:00:13,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 04:00:13,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 04:00:13,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 04:00:13,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 04:00:13,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 04:00:13,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 04:00:13,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 04:00:13,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 04:00:13,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 04:00:13,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 04:00:13,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 04:00:13,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf [2018-10-01 04:00:13,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 04:00:13,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 04:00:13,715 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 04:00:13,715 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 04:00:13,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 04:00:13,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 04:00:13,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 04:00:13,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 04:00:13,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 04:00:13,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 04:00:13,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 04:00:13,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 04:00:13,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 04:00:13,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 04:00:13,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 04:00:13,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 04:00:13,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 04:00:13,721 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-01 04:00:13,722 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-01 04:00:13,722 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 04:00:13,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 04:00:13,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 04:00:13,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 04:00:13,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 04:00:13,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 04:00:13,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 04:00:13,724 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-01 04:00:13,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 04:00:13,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 04:00:13,725 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 04:00:13,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 04:00:13,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 04:00:13,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 04:00:13,795 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 04:00:13,796 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 04:00:13,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-10-01 04:00:13,797 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-01 04:00:13,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 04:00:13,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 04:00:13,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 04:00:13,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 04:00:13,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 04:00:13,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 04:00:13,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 04:00:13,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 04:00:13,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 04:00:13,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... [2018-10-01 04:00:13,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 04:00:13,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 04:00:13,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 04:00:13,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 04:00:13,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 04:00:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-01 04:00:14,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 04:00:14,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 04:00:15,509 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 04:00:15,510 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 04:00:15 BoogieIcfgContainer [2018-10-01 04:00:15,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 04:00:15,511 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-01 04:00:15,511 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-01 04:00:15,524 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-01 04:00:15,525 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 04:00:15" (1/1) ... [2018-10-01 04:00:15,543 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 04:00:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2018-10-01 04:00:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2018-10-01 04:00:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 04:00:15,594 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:15,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-10-01 04:00:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 17 states and 24 transitions. [2018-10-01 04:00:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2018-10-01 04:00:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 04:00:16,661 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2018-10-01 04:00:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-10-01 04:00:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 04:00:17,202 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-10-01 04:00:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-01 04:00:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 04:00:17,956 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 26 states and 38 transitions. [2018-10-01 04:00:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-01 04:00:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 04:00:18,591 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 04:00:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2018-10-01 04:00:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-01 04:00:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 04:00:19,580 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 04:00:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2018-10-01 04:00:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-01 04:00:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 04:00:20,220 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 31 states and 43 transitions. [2018-10-01 04:00:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-01 04:00:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 04:00:20,720 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 32 states and 44 transitions. [2018-10-01 04:00:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2018-10-01 04:00:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 04:00:21,056 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 04:00:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2018-10-01 04:00:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-01 04:00:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 04:00:21,902 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-01 04:00:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 36 states and 48 transitions. [2018-10-01 04:00:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2018-10-01 04:00:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 04:00:22,546 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 04:00:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2018-10-01 04:00:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-10-01 04:00:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 04:00:23,176 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 55 states and 78 transitions. [2018-10-01 04:00:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-01 04:00:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 04:00:27,760 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 57 states and 79 transitions. [2018-10-01 04:00:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-10-01 04:00:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 04:00:28,584 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-01 04:00:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 58 states and 80 transitions. [2018-10-01 04:00:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2018-10-01 04:00:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 04:00:29,255 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 04:00:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 59 states and 82 transitions. [2018-10-01 04:00:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-01 04:00:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 04:00:30,338 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-01 04:00:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 60 states and 83 transitions. [2018-10-01 04:00:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-10-01 04:00:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 04:00:31,518 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 04:00:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 62 states and 85 transitions. [2018-10-01 04:00:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-10-01 04:00:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 04:00:32,082 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 91 states and 140 transitions. [2018-10-01 04:00:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2018-10-01 04:00:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 04:00:40,647 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 94 states and 141 transitions. [2018-10-01 04:00:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2018-10-01 04:00:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 04:00:43,039 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 04:00:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 95 states and 141 transitions. [2018-10-01 04:00:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2018-10-01 04:00:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 04:00:44,596 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-01 04:00:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 96 states and 142 transitions. [2018-10-01 04:00:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2018-10-01 04:00:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 04:00:46,387 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 04:00:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 04:00:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-01 04:00:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 04:00:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2018-10-01 04:00:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-01 04:00:47,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 04:00:47,262 WARN L420 CodeCheckObserver]: This Program is SAFE, Check terminated with 0 iterations. [2018-10-01 04:00:47,272 INFO L776 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-01 04:00:47,302 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.10 04:00:47 ImpRootNode [2018-10-01 04:00:47,302 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-01 04:00:47,303 INFO L168 Benchmark]: Toolchain (without parser) took 33441.28 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -230.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. [2018-10-01 04:00:47,306 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 04:00:47,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 04:00:47,307 INFO L168 Benchmark]: Boogie Preprocessor took 41.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 04:00:47,307 INFO L168 Benchmark]: RCFGBuilder took 1558.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-01 04:00:47,308 INFO L168 Benchmark]: CodeCheck took 31791.02 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -294.0 MB). Peak memory consumption was 65.1 MB. Max. memory is 7.1 GB. [2018-10-01 04:00:47,313 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, 33 locations, 1 error locations. SAFE Result, 31.7s OverallTime, 23 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35258368 SDtfs, 38976534 SDslu, 66766822 SDs, 0 SdLazy, 36287458 SolverSat, 24225130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 100777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 378/558 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 - PositiveResult [Line: 333]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((~wl_pc == 1 && ((~wb_pc <= 0 || ((((!(~r_st == 0) && 2 == ~c1_st) && !(~e_c == 0)) && !(~c1_st == 0)) && 2 <= ~e_c)) || !(~wb_pc == 1))) && 0 <= ~d) && ~d <= 0) && ((1 <= ~c1_pc || !(~c1_pc == 1)) || ~c1_pc <= 0)) && ((~c2_pc <= 0 || !(~c2_pc == 1)) || 1 <= ~c2_pc)) || (!(~wl_pc == 1) && (!(~wl_pc == 2) || ~wl_pc <= 1))) || (((((((0 <= ~t_b && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((((((((((~wl_st == 0 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && !(~e_c == 0)) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) || ((((((((!(~wl_st == 0 || !(~r_st == 0)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((((((~r_st == 0 && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 0) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((((((((~r_st == 0 && !(~r_st == 0 && ~wl_pc == 1)) && 0 <= ~t_b) && 2 <= ~data) && !(~wl_pc == 0)) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && (!(~wl_pc == 2) || ~wl_pc <= 1)) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((~r_st == 0 && ~wl_pc == 1) && !(~wl_pc == 0)) && (!(~wl_pc == 2) || ~wl_pc <= 1)) && !(~wl_st == 0))) || ((((((((~wb_pc == 1 && ~wl_st == 0) && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && (!(~wl_pc == 2) || ~wl_pc <= 1))) || ((((0 <= ~t_b && ~wl_st == 0) && ~t_b <= 0) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~d == 2) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((0 <= ~t_b && ~t_b <= 0) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~d == 2) || (((((((~wb_pc == 1 && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && (!(~wl_pc == 2) || ~wl_pc <= 1))) || ((((((((((0 <= ~d && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 0) && !(~e_c == 0)) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((~wb_pc == 1 && !(~wl_pc == 1)) && ~wl_st == 0) && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && (!(~wl_pc == 2) || ~wl_pc <= 1)) || ((((((((!(~wl_st == 0 || !(~r_st == 0)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((((((((((0 <= ~d && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && ~wl_st == 0) && ~c <= ~c_t) && ~d <= 0) && !(~e_c == 0))) || (((((((!(~wl_pc == 1 && !(~wl_st == 0)) && ~wl_pc == 1) && ~wb_pc == 1) && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc))) || ((((((((~wb_pc <= 0 || ((((~c1_st == 2 && ((~c_t < ~c + 1 || ~c_t < ~c) || ~c_t <= ~c)) && ~c <= ~c_t) && !(~e_c == 0)) && 2 <= ~e_c)) || !(~wb_pc == 1)) && ~wl_pc == 1) && 0 <= ~d) && ~d <= 0) && ((1 <= ~c1_pc || !(~c1_pc == 1)) || ~c1_pc <= 0)) && ((~c2_pc <= 0 || !(~c2_pc == 1)) || 1 <= ~c2_pc)) && !(~wl_st == 0))) || ((((0 <= ~t_b && ~wl_st == 0) && ~t_b <= 0) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~d == 2)) || ((((((((~data == ~c_t && 0 <= ~t_b) && (~wl_st == 0 || !(~r_st == 0))) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~c_req_up == 1) && !(~wl_st == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((~wb_pc == 1 && !(~wl_pc == 1)) && ~wl_st == 0) && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && (!(~wl_pc == 2) || ~wl_pc <= 1)) || ((((((((!(~wl_st == 0 || !(~r_st == 0)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((((((((((0 <= ~d && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && ~wl_st == 0) && ~c <= ~c_t) && ~d <= 0) && !(~e_c == 0))) || (((((((!(~wl_pc == 1 && !(~wl_st == 0)) && ~wl_pc == 1) && ~wb_pc == 1) && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc))) || ((((((((~wb_pc <= 0 || ((((~c1_st == 2 && ((~c_t < ~c + 1 || ~c_t < ~c) || ~c_t <= ~c)) && ~c <= ~c_t) && !(~e_c == 0)) && 2 <= ~e_c)) || !(~wb_pc == 1)) && ~wl_pc == 1) && 0 <= ~d) && ~d <= 0) && ((1 <= ~c1_pc || !(~c1_pc == 1)) || ~c1_pc <= 0)) && ((~c2_pc <= 0 || !(~c2_pc == 1)) || 1 <= ~c2_pc)) && !(~wl_st == 0))) || ((((0 <= ~t_b && ~wl_st == 0) && ~t_b <= 0) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~d == 2)) || ((((((((~data == ~c_t && 0 <= ~t_b) && (~wl_st == 0 || !(~r_st == 0))) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~c_req_up == 1) && !(~wl_st == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((!(~wl_pc == 1) && 0 <= ~t_b) && !((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((((~wb_pc <= 0 || ((((~c1_st == 2 && ((~c_t < ~c + 1 || ~c_t < ~c) || ~c_t <= ~c)) && ~c <= ~c_t) && !(~e_c == 0)) && 2 <= ~e_c)) || !(~wb_pc == 1)) && ~wl_pc == 1) && 0 <= ~d) && ~d <= 0) && ((1 <= ~c1_pc || !(~c1_pc == 1)) || ~c1_pc <= 0)) && ((~c2_pc <= 0 || !(~c2_pc == 1)) || 1 <= ~c2_pc)) && !(~wl_st == 0))) || ((((((((!(~wl_pc == 1) && ~data == ~c_t) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ((!(~r_st == 0) && !(~wl_st == 0)) || (~wb_pc == 1 && ~wb_pc <= 0))) && !(~c1_st == 0)) && ~c_req_up == 1) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((0 <= ~t_b && ~t_b <= 0) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~d == 2) || ((((((~wb_pc == 1 && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && (!(~wl_pc == 2) || ~wl_pc <= 1)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((!(~wl_st == 0 || !(~r_st == 0)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !(!(~wl_pc == 2) || ~wl_pc <= 1)) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((((((((0 <= ~d && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && ~wl_st == 0) && ~c <= ~c_t) && ~d <= 0) && !(~e_c == 0))) || ((((((((~wb_pc == 1 && ~wl_st == 0) && ((~wb_pc == 1 && ~wb_pc <= 0) || !(~r_st == 0))) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1))) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && (!(~wl_pc == 2) || ~wl_pc <= 1)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((~wl_pc == 1 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~c1_pc == 0) && !(~e_c == 0)) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0)) || (((~r_st == 0 && ~wl_pc == 1) && !(((((~c1_st == 0 && ~c <= ~c_t) && !(~e_c == 0)) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c)) && !(~wl_st == 0))) || ((((((((((((!(~wl_pc == 1) && ~wl_pc == 2) && ~d == ~t_b) && 0 <= ~d) && ~c1_st == 0) && ((~c2_pc <= 0 && ~c2_pc == 1) || 1 <= ~c2_pc)) && ~d == ~data) && ~c2_st == 0) && ~wb_pc == 1) && ~e_f == ~wl_pc) && ~d <= 0) && ((!(~r_st == 0) && !(~wl_st == 0)) || (~wb_pc == 1 && ~wb_pc <= 0))) && (1 <= ~c1_pc || (~c1_pc <= 0 && ~c1_pc == 1)))) || (((((((((~r_st == 0 && ~wl_pc == 1) && !((((~wl_pc == 1 && 0 <= ~d) && ~d <= 0) && ~c1_pc == 0) && ~c2_pc == 0)) && ~c1_st == 0) && ~c <= ~c_t) && !(~e_c == 0)) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0))) || ((((((((~r_st == 0 && !(~wl_pc == 1)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && !((!(~r_st == 0) && !(~wl_st == 0)) || (~wb_pc == 1 && ~wb_pc <= 0))) && ~data == ~c) && !(~c1_st == 0)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1558.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * CodeCheck took 31791.02 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -294.0 MB). Peak memory consumption was 65.1 MB. Max. memory is 7.1 GB. RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-01_04-00-47-335.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-01_04-00-47-335.csv Received shutdown request...