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-133090d [2018-10-04 10:47:54,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 10:47:54,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 10:47:54,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 10:47:54,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 10:47:54,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 10:47:54,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 10:47:54,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 10:47:54,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 10:47:54,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 10:47:54,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 10:47:54,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 10:47:54,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 10:47:54,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 10:47:54,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 10:47:54,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 10:47:54,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 10:47:54,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 10:47:54,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 10:47:54,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 10:47:54,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 10:47:54,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 10:47:54,494 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 10:47:54,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 10:47:54,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 10:47:54,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 10:47:54,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 10:47:54,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 10:47:54,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 10:47:54,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 10:47:54,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 10:47:54,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 10:47:54,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 10:47:54,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 10:47:54,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 10:47:54,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 10:47:54,502 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-04 10:47:54,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 10:47:54,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 10:47:54,524 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 10:47:54,524 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 10:47:54,524 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 10:47:54,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 10:47:54,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 10:47:54,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 10:47:54,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 10:47:54,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 10:47:54,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 10:47:54,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 10:47:54,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 10:47:54,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 10:47:54,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 10:47:54,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 10:47:54,527 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 10:47:54,527 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 10:47:54,528 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 10:47:54,529 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 10:47:54,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 10:47:54,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 10:47:54,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 10:47:54,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 10:47:54,530 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 10:47:54,530 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 10:47:54,530 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 10:47:54,530 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 10:47:54,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 10:47:54,531 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 10:47:54,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 10:47:54,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 10:47:54,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 10:47:54,622 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 10:47:54,623 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 10:47:54,623 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-04 10:47:54,624 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-04 10:47:54,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 10:47:54,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 10:47:54,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 10:47:54,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 10:47:54,714 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 10:47:54,735 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,751 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 10:47:54,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 10:47:54,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 10:47:54,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 10:47:54,773 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,774 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,779 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,779 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,801 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,809 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,813 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 04.10 10:47:54" (1/1) ... [2018-10-04 10:47:54,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 10:47:54,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 10:47:54,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 10:47:54,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 10:47:54,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:47:54" (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-04 10:47:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 10:47:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 10:47:56,290 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 10:47:56,291 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:47:56 BoogieIcfgContainer [2018-10-04 10:47:56,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 10:47:56,292 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 10:47:56,292 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 10:47:56,304 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 10:47:56,305 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 04.10 10:47:56" (1/1) ... [2018-10-04 10:47:56,319 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 10:47:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:47:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2018-10-04 10:47:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2018-10-04 10:47:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:47:56,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:47:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:47:56,603 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-04 10:47:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:47:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 17 states and 24 transitions. [2018-10-04 10:47:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2018-10-04 10:47:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 10:47:57,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:47:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:47:57,386 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-04 10:47:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:47:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 19 states and 26 transitions. [2018-10-04 10:47:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-10-04 10:47:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:47:57,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:47:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:47:57,740 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-04 10:47:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:47:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-10-04 10:47:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-04 10:47:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 10:47:58,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:47:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:47:58,627 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-04 10:47:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:47:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 26 states and 38 transitions. [2018-10-04 10:47:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-10-04 10:47:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:47:59,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:47:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:47:59,206 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-04 10:47:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:47:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2018-10-04 10:47:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 10:47:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 10:47:59,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:47:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:47:59,892 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-04 10:48:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 28 states and 37 transitions. [2018-10-04 10:48:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-04 10:48:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:48:00,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:00,601 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-04 10:48:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 31 states and 43 transitions. [2018-10-04 10:48:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-04 10:48:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:48:01,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:01,118 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-04 10:48:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 32 states and 44 transitions. [2018-10-04 10:48:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2018-10-04 10:48:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:48:01,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:01,565 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-04 10:48:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2018-10-04 10:48:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-04 10:48:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 10:48:01,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:01,921 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-04 10:48:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 36 states and 48 transitions. [2018-10-04 10:48:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2018-10-04 10:48:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 10:48:02,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:02,351 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-04 10:48:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 39 states and 49 transitions. [2018-10-04 10:48:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-10-04 10:48:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:48:02,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:03,439 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-04 10:48:05,378 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 14 [2018-10-04 10:48:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 55 states and 78 transitions. [2018-10-04 10:48:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-10-04 10:48:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:48:06,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:06,842 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-04 10:48:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 57 states and 79 transitions. [2018-10-04 10:48:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2018-10-04 10:48:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:48:07,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:07,617 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-04 10:48:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 58 states and 80 transitions. [2018-10-04 10:48:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2018-10-04 10:48:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:48:08,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:08,539 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-04 10:48:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 59 states and 82 transitions. [2018-10-04 10:48:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-04 10:48:09,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:48:09,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:09,734 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-04 10:48:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 60 states and 83 transitions. [2018-10-04 10:48:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-10-04 10:48:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 10:48:10,878 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:10,986 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-04 10:48:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 62 states and 85 transitions. [2018-10-04 10:48:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-10-04 10:48:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 10:48:11,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:12,389 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-04 10:48:13,538 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 34 new depth: 23 [2018-10-04 10:48:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 91 states and 140 transitions. [2018-10-04 10:48:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2018-10-04 10:48:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 10:48:21,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:22,413 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-04 10:48:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 94 states and 141 transitions. [2018-10-04 10:48:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2018-10-04 10:48:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 10:48:23,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:23,977 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-04 10:48:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 95 states and 141 transitions. [2018-10-04 10:48:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2018-10-04 10:48:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 10:48:25,160 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:25,248 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-04 10:48:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 96 states and 142 transitions. [2018-10-04 10:48:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2018-10-04 10:48:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 10:48:26,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:48:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:48:26,815 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-04 10:48:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:48:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 41 states and 44 transitions. [2018-10-04 10:48:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-04 10:48:27,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 10:48:27,516 WARN L425 CodeCheckObserver]: This Program is SAFE, Check terminated with 23 iterations. [2018-10-04 10:48:27,526 INFO L778 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-10-04 10:48:27,751 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2018-10-04 10:48:27,965 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2018-10-04 10:48:28,080 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-10-04 10:48:28,422 WARN L178 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2018-10-04 10:48:28,741 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2018-10-04 10:48:28,899 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2018-10-04 10:48:29,103 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2018-10-04 10:48:29,368 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2018-10-04 10:48:29,369 INFO L582 CodeCheckObserver]: Invariant with dag size 40 [2018-10-04 10:48:29,378 INFO L582 CodeCheckObserver]: Invariant with dag size 50 [2018-10-04 10:48:29,380 INFO L582 CodeCheckObserver]: Invariant with dag size 39 [2018-10-04 10:48:29,381 INFO L582 CodeCheckObserver]: Invariant with dag size 60 [2018-10-04 10:48:29,383 INFO L582 CodeCheckObserver]: Invariant with dag size 60 [2018-10-04 10:48:29,385 INFO L582 CodeCheckObserver]: Invariant with dag size 45 [2018-10-04 10:48:29,386 INFO L582 CodeCheckObserver]: Invariant with dag size 25 [2018-10-04 10:48:29,387 INFO L582 CodeCheckObserver]: Invariant with dag size 48 [2018-10-04 10:48:29,388 INFO L582 CodeCheckObserver]: Invariant with dag size 53 [2018-10-04 10:48:29,390 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 10:48:29 ImpRootNode [2018-10-04 10:48:29,390 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 10:48:29,391 INFO L168 Benchmark]: Toolchain (without parser) took 34678.76 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.6 GB in the end (delta: -89.7 MB). Peak memory consumption was 269.4 MB. Max. memory is 7.1 GB. [2018-10-04 10:48:29,392 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-04 10:48:29,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.67 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-04 10:48:29,394 INFO L168 Benchmark]: Boogie Preprocessor took 58.55 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-04 10:48:29,394 INFO L168 Benchmark]: RCFGBuilder took 1471.12 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-04 10:48:29,395 INFO L168 Benchmark]: CodeCheck took 33098.40 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.6 GB in the end (delta: -153.1 MB). Peak memory consumption was 206.0 MB. Max. memory is 7.1 GB. [2018-10-04 10:48:29,400 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.1s OverallTime, 23 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35258368 SDtfs, 38976478 SDslu, 66766822 SDs, 0 SdLazy, 36287402 SolverSat, 24225130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4015 GetRequests, 3667 SyntacticMatches, 95 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 101157 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 && (((!(~r_st == 0) && 2 == ~c1_st) && 2 <= ~e_c) || !(~wb_pc == 1))) && 0 <= ~d) && ~d <= 0) || (!(~wl_pc == 1) && !(~wl_pc == 2))) || (((((((0 <= ~t_b && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 2) && ~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) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) || (((((((~r_st == 0 && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((~r_st == 0 && ~wl_pc == 1) && !(~wl_st == 0))) || ((((((((~wb_pc == 1 && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~wl_pc == 2))) || ((((0 <= ~t_b && ~wl_st == 0) && ~t_b <= 0) && ~wl_pc == 2) && ~d == 2) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((~wb_pc == 1 && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~wl_pc == 2)) || (((0 <= ~t_b && ~t_b <= 0) && ~wl_pc == 2) && ~d == 2)) || (((((((((0 <= ~d && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~c1_pc == 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_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~wl_pc == 2)) || ((((((((~r_st == 0 && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 2) && ~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)) || ((((((((~c1_st == 2 && ~c_t <= ~c) && ~c <= ~c_t) && 2 <= ~e_c) || !(~wb_pc == 1)) && ~wl_pc == 1) && 0 <= ~d) && ~d <= 0) && !(~wl_st == 0))) || ((((0 <= ~t_b && ~wl_st == 0) && ~t_b <= 0) && ~wl_pc == 2) && ~d == 2)) || ((((((((~data == ~c_t && 0 <= ~t_b) && !(~r_st == 0)) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 2) && ~c_req_up == 1) && !(~wl_st == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((~wb_pc == 1 && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~wl_pc == 2)) || ((((((((~r_st == 0 && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 2) && ~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)) || ((((((((~c1_st == 2 && ~c_t <= ~c) && ~c <= ~c_t) && 2 <= ~e_c) || !(~wb_pc == 1)) && ~wl_pc == 1) && 0 <= ~d) && ~d <= 0) && !(~wl_st == 0))) || ((((0 <= ~t_b && ~wl_st == 0) && ~t_b <= 0) && ~wl_pc == 2) && ~d == 2)) || ((((((((~data == ~c_t && 0 <= ~t_b) && !(~r_st == 0)) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 2) && ~c_req_up == 1) && !(~wl_st == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((!(~wl_pc == 1) && 0 <= ~t_b) && ~r_st == 0) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~data == ~c) && !(~c1_st == 0)) && !(~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)) && !(~c1_st == 0)) && ~c_req_up == 1)) || ((((((((~c1_st == 2 && ~c_t <= ~c) && ~c <= ~c_t) && 2 <= ~e_c) || !(~wb_pc == 1)) && ~wl_pc == 1) && 0 <= ~d) && ~d <= 0) && !(~wl_st == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((0 <= ~t_b && ~t_b <= 0) && ~wl_pc == 2) && ~d == 2) || ((((((~wb_pc == 1 && !(~r_st == 0)) && 0 <= ~d) && ~d <= 0) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~wl_pc == 2)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((~r_st == 0 && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~wl_pc == 2) && ~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)) || ((((((((~wb_pc == 1 && ~wl_st == 0) && !(~r_st == 0)) && !(~wl_pc == 0)) && 0 <= ~d) && ~d <= 0) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~wl_pc == 2)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((~wl_pc == 1 && 0 <= ~d) && ~c1_st == 0) && ~c <= ~c_t) && ~d <= 0) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0)) || ((~r_st == 0 && ~wl_pc == 1) && !(~wl_st == 0))) || (((((((((((~wl_pc == 2 && ~d == ~t_b) && 0 <= ~d) && ~c1_st == 0) && 1 <= ~c2_pc) && ~d == ~data) && ~c2_st == 0) && ~wb_pc == 1) && ~e_f == ~wl_pc) && ~d <= 0) && !(~r_st == 0) && !(~wl_st == 0)) && 1 <= ~c1_pc)) || (((((((~r_st == 0 && !(~wl_pc == 1)) && 0 <= ~t_b) && 2 <= ~data) && ~t_b <= 0) && ~data <= 2) && ~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.20 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 46.67 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 58.55 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 1471.12 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 33098.40 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.6 GB in the end (delta: -153.1 MB). Peak memory consumption was 206.0 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-04_10-48-29-420.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-04_10-48-29-420.csv Received shutdown request...