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/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 13:14:51,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 13:14:51,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 13:14:51,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 13:14:51,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 13:14:51,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 13:14:51,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 13:14:51,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 13:14:51,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 13:14:51,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 13:14:51,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 13:14:51,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 13:14:51,715 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 13:14:51,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 13:14:51,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 13:14:51,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 13:14:51,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 13:14:51,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 13:14:51,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 13:14:51,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 13:14:51,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 13:14:51,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 13:14:51,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 13:14:51,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 13:14:51,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 13:14:51,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 13:14:51,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 13:14:51,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 13:14:51,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 13:14:51,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 13:14:51,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 13:14:51,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 13:14:51,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 13:14:51,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 13:14:51,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 13:14:51,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 13:14:51,759 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-02 13:14:51,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 13:14:51,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 13:14:51,786 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 13:14:51,787 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 13:14:51,787 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 13:14:51,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 13:14:51,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 13:14:51,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 13:14:51,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 13:14:51,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 13:14:51,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 13:14:51,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 13:14:51,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 13:14:51,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 13:14:51,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 13:14:51,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 13:14:51,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 13:14:51,790 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-02 13:14:51,790 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-02 13:14:51,790 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 13:14:51,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 13:14:51,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 13:14:51,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-02 13:14:51,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 13:14:51,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 13:14:51,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 13:14:51,792 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-02 13:14:51,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 13:14:51,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 13:14:51,792 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 13:14:51,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 13:14:51,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 13:14:51,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 13:14:51,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 13:14:51,880 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 13:14:51,881 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-10-02 13:14:51,881 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-10-02 13:14:51,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 13:14:51,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 13:14:51,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 13:14:51,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 13:14:51,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 13:14:51,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 13:14:52,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 13:14:52,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 13:14:52,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 13:14:52,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (1/1) ... [2018-10-02 13:14:52,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 13:14:52,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 13:14:52,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 13:14:52,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 13:14:52,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 01:14:51" (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-02 13:14:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 13:14:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 13:14:52,367 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 13:14:52,367 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:14:52 BoogieIcfgContainer [2018-10-02 13:14:52,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 13:14:52,368 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-02 13:14:52,368 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-02 13:14:52,379 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-02 13:14:52,380 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:14:52" (1/1) ... [2018-10-02 13:14:52,392 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 13:14:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 13:14:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 13:14:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 13:14:52,436 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:52,594 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-02 13:14:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 13:14:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 13:14:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 13:14:52,941 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 13:14:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 13:14:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 13:14:53,618 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 13:14:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 13:14:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 13:14:54,201 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 13:14:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 13:14:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 13:14:54,956 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-02 13:14:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-02 13:14:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 13:14:55,460 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 13:14:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 13:14:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 13:14:56,358 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-02 13:14:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-02 13:14:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 13:14:57,525 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 13:14:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 13:14:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 13:14:57,962 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-02 13:14:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-02 13:14:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 13:14:58,440 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 13:14:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 13:14:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 13:14:58,896 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:14:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:14:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 13:14:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 13:14:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 13:14:59,514 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:14:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:14:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:15:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:15:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 13:15:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 13:15:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 13:15:00,088 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:15:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:15:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:15:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:15:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-02 13:15:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-02 13:15:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 13:15:00,636 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:15:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:15:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:15:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:15:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 13:15:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 13:15:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 13:15:01,263 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:15:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:15:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:15:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:15:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-02 13:15:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-02 13:15:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 13:15:02,064 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:15:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 13:15:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 13:15:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-02 13:15:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 13:15:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 13:15:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 13:15:02,960 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-02 13:15:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 13:15:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 13:15:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 13:15:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-02 13:15:03,091 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-10-02 13:15:03,098 INFO L760 CodeCheckObserver]: 0 DeclaredPredicates, 1945 GetRequests, 1643 SyntacticMatches, 240 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s Time 1.8s impTime [2018-10-02 13:15:03,126 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.10 01:15:03 ImpRootNode [2018-10-02 13:15:03,133 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-02 13:15:03,134 INFO L168 Benchmark]: Toolchain (without parser) took 11168.00 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 15.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 346.7 MB). Peak memory consumption was 361.9 MB. Max. memory is 7.1 GB. [2018-10-02 13:15:03,137 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-02 13:15:03,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.51 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-02 13:15:03,139 INFO L168 Benchmark]: Boogie Preprocessor took 37.48 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-02 13:15:03,140 INFO L168 Benchmark]: RCFGBuilder took 317.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 13:15:03,141 INFO L168 Benchmark]: CodeCheck took 10764.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 15.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 325.6 MB). Peak memory consumption was 340.8 MB. Max. memory is 7.1 GB. [2018-10-02 13:15:03,149 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, 7 locations, 1 error locations. UNSAFE Result, 10.6s OverallTime, 17 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98304 SDtfs, 196604 SDslu, 327672 SDs, 0 SdLazy, 491510 SolverSat, 294906 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 44080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 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 - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L32] assume true; VAL [main_~i~5=0, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L32] assume true; VAL [main_~i~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L32] assume true; VAL [main_~i~5=2] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L32] assume true; VAL [main_~i~5=3] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L32] assume true; VAL [main_~i~5=4] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L32] assume true; VAL [main_~i~5=5] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L32] assume true; VAL [main_~i~5=6] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L32] assume true; VAL [main_~i~5=7] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L32] assume true; VAL [main_~i~5=8] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L32] assume true; VAL [main_~i~5=9] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L32] assume true; VAL [main_~i~5=10] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L32] assume true; VAL [main_~i~5=11] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L32] assume true; VAL [main_~i~5=12] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L32] assume true; VAL [main_~i~5=13] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L32] assume true; VAL [main_~i~5=14] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L32] assume true; VAL [main_~i~5=15] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L32] assume true; VAL [main_~i~5=16] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=1, main_~z~5=0] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=1, main_~z~5=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 42.51 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 37.48 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 317.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 10764.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 15.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 325.6 MB). Peak memory consumption was 340.8 MB. Max. memory is 7.1 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-02_13-15-03-170.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-02_13-15-03-170.csv Received shutdown request...