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/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 10:36:48,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 10:36:48,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 10:36:48,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 10:36:48,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 10:36:48,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 10:36:48,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 10:36:48,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 10:36:48,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 10:36:48,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 10:36:48,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 10:36:48,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 10:36:48,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 10:36:48,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 10:36:48,644 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 10:36:48,644 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 10:36:48,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 10:36:48,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 10:36:48,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 10:36:48,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 10:36:48,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 10:36:48,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 10:36:48,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 10:36:48,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 10:36:48,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 10:36:48,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 10:36:48,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 10:36:48,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 10:36:48,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 10:36:48,674 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 10:36:48,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 10:36:48,675 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 10:36:48,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 10:36:48,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 10:36:48,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 10:36:48,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 10:36:48,680 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:36:48,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 10:36:48,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 10:36:48,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 10:36:48,707 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 10:36:48,708 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 10:36:48,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 10:36:48,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 10:36:48,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 10:36:48,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 10:36:48,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 10:36:48,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 10:36:48,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 10:36:48,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 10:36:48,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 10:36:48,710 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 10:36:48,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 10:36:48,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 10:36:48,710 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 10:36:48,710 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 10:36:48,711 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 10:36:48,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 10:36:48,711 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 10:36:48,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 10:36:48,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 10:36:48,712 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 10:36:48,712 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 10:36:48,712 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 10:36:48,712 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 10:36:48,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 10:36:48,713 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 10:36:48,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 10:36:48,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 10:36:48,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 10:36:48,778 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 10:36:48,779 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 10:36:48,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-10-04 10:36:48,781 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-10-04 10:36:48,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 10:36:48,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 10:36:48,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 10:36:48,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 10:36:48,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 10:36:48,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 10:36:48,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 10:36:48,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 10:36:48,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 10:36:48,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (1/1) ... [2018-10-04 10:36:48,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 10:36:48,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 10:36:48,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 10:36:48,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 10:36:48,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:36:48" (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:36:48,992 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 10:36:48,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 10:36:48,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 10:36:49,249 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 10:36:49,250 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:36:49 BoogieIcfgContainer [2018-10-04 10:36:49,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 10:36:49,250 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 10:36:49,251 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 10:36:49,263 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 10:36:49,264 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:36:49" (1/1) ... [2018-10-04 10:36:49,282 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 10:36:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 10:36:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 10:36:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 10:36:49,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:49,573 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:36:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 10:36:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 10:36:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 10:36:49,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 10:36:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 10:36:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 10:36:50,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 10:36:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 10:36:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 10:36:50,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:50,654 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-04 10:36:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 10:36:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 10:36:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 10:36:51,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 10:36:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 10:36:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:36:51,506 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 10:36:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 10:36:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 10:36:51,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 10:36:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 10:36:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 10:36:52,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 10:36:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 10:36:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 10:36:52,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 10:36:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 10:36:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:36:52,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 10:36:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 10:36:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 10:36:53,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 10:36:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 10:36:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:36:53,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 10:36:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 10:36:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 10:36:54,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 10:36:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 10:36:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 10:36:55,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 10:36:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 10:36:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 10:36:55,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 10:36:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 10:36:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:36:55,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:36:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:36:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:36:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 20 states and 19 transitions. [2018-10-04 10:36:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2018-10-04 10:36:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 10:36:56,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:36:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:36:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:36:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:36:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:36:56,282 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 17 iterations. [2018-10-04 10:36:56,313 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 10:36:56 ImpRootNode [2018-10-04 10:36:56,313 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 10:36:56,314 INFO L168 Benchmark]: Toolchain (without parser) took 7471.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 383.3 MB). Peak memory consumption was 383.3 MB. Max. memory is 7.1 GB. [2018-10-04 10:36:56,316 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:36:56,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.58 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:36:56,318 INFO L168 Benchmark]: Boogie Preprocessor took 23.98 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:36:56,318 INFO L168 Benchmark]: RCFGBuilder took 341.28 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 10:36:56,319 INFO L168 Benchmark]: CodeCheck took 7062.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 362.2 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. [2018-10-04 10:36:56,324 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, 6 locations, 1 error locations. UNSAFE Result, 6.9s OverallTime, 17 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32768 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 393206 SolverSat, 393210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1113 GetRequests, 931 SyntacticMatches, 120 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/680 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 61]: assertion can be violated assertion can be violated We found a FailurePath: [L18] havoc main_#res; [L19] havoc main_#t~nondet0, main_~yy~5, main_~z~5, main_#t~nondet1, main_~xx~5, main_~x~5, main_~y~5, main_~zz~5, main_~i~5; [L20] main_~x~5 := main_#t~nondet0; [L21] havoc main_#t~nondet0; [L22] main_~y~5 := main_#t~nondet1; [L23] havoc main_#t~nondet1; [L24] havoc main_~xx~5; [L25] havoc main_~yy~5; [L26] havoc main_~zz~5; [L27] main_~z~5 := 0; [L28] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L56] assume 0 <= main_~i~5 && main_~i~5 < 16; [L57] havoc main_~z~5; [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L35] assume main_~i~5 < 4294967296 && !(main_~i~5 < 16); [L36] assume main_~x~5 < -65536; [L37] main_~xx~5 := main_~x~5 % 65536; [L38] assume main_~y~5 < -65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] havoc main_~xx~5; [L41] havoc main_~xx~5; [L42] havoc main_~xx~5; [L43] havoc main_~xx~5; [L44] havoc main_~yy~5; [L45] havoc main_~yy~5; [L46] havoc main_~yy~5; [L47] havoc main_~yy~5; [L48] havoc main_~zz~5; [L49] assume (((main_~zz~5 < 4294967296 && 0 <= main_~zz~5) && -4294967296 <= main_~z~5) && main_~z~5 < 0) && !(main_~z~5 + 4294967296 == main_~zz~5); [L50] __VERIFIER_assert_#in~cond := 0; [L51] havoc __VERIFIER_assert_~cond; [L52] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L53] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=-65537, main_~y~5=-65537, main_~zz~5=0, main_~z~5=-1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 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 39.58 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 23.98 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 341.28 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 7062.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 362.2 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-04_10-36-56-339.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bplTransformedIcfg_BEv2_4.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-04_10-36-56-339.csv Received shutdown request...