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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 21:14:26,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 21:14:26,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 21:14:26,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 21:14:26,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 21:14:26,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 21:14:26,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 21:14:26,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 21:14:26,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 21:14:26,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 21:14:26,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 21:14:26,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 21:14:26,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 21:14:26,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 21:14:26,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 21:14:26,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 21:14:26,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 21:14:26,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 21:14:26,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 21:14:26,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 21:14:26,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 21:14:26,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 21:14:26,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 21:14:26,606 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 21:14:26,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 21:14:26,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 21:14:26,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 21:14:26,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 21:14:26,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 21:14:26,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 21:14:26,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 21:14:26,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 21:14:26,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 21:14:26,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 21:14:26,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 21:14:26,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 21:14:26,613 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf [2018-09-30 21:14:26,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 21:14:26,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 21:14:26,636 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 21:14:26,636 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 21:14:26,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 21:14:26,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 21:14:26,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 21:14:26,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 21:14:26,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 21:14:26,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 21:14:26,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 21:14:26,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 21:14:26,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 21:14:26,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 21:14:26,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 21:14:26,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 21:14:26,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 21:14:26,647 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-09-30 21:14:26,649 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-09-30 21:14:26,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 21:14:26,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 21:14:26,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-09-30 21:14:26,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 21:14:26,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 21:14:26,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 21:14:26,650 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-09-30 21:14:26,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 21:14:26,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 21:14:26,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 21:14:26,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 21:14:26,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 21:14:26,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 21:14:26,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 21:14:26,728 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 21:14:26,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl [2018-09-30 21:14:26,729 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl' [2018-09-30 21:14:26,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 21:14:26,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 21:14:26,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 21:14:26,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 21:14:26,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 21:14:26,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 21:14:26,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 21:14:26,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 21:14:26,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 21:14:26,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (1/1) ... [2018-09-30 21:14:26,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 21:14:26,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 21:14:26,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 21:14:26,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 21:14:26,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:14:26" (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-09-30 21:14:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 21:14:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 21:14:27,171 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 21:14:27,172 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 09:14:27 BoogieIcfgContainer [2018-09-30 21:14:27,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 21:14:27,172 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-09-30 21:14:27,172 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-09-30 21:14:27,181 INFO L276 PluginConnector]: CodeCheck initialized [2018-09-30 21:14:27,182 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 09:14:27" (1/1) ... [2018-09-30 21:14:27,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 21:14:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:14:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 21:14:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 21:14:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 21:14:27,234 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:14:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:14:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:14:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:14:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 21:14:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 21:14:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 21:14:27,621 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:14:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:14:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:14:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:14:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-09-30 21:14:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-30 21:14:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 21:14:27,927 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:14:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:14:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:14:33,919 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 21:14:35,540 WARN L178 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 21:14:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:14:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-09-30 21:14:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-30 21:14:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 21:14:38,415 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:14:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:14:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:14:39,924 WARN L178 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-30 21:14:47,399 WARN L178 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 28 [2018-09-30 21:14:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:14:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-09-30 21:14:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-30 21:14:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 21:14:47,527 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:14:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:14:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:14:55,083 WARN L178 SmtUtils]: Spent 3.23 s on a formula simplification that was a NOOP. DAG size: 33 [2018-09-30 21:15:00,070 WARN L178 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-30 21:15:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:15:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-09-30 21:15:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-30 21:15:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 21:15:01,704 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:15:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:15:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:15:14,497 WARN L178 SmtUtils]: Spent 3.82 s on a formula simplification that was a NOOP. DAG size: 39 [2018-09-30 21:15:23,590 WARN L178 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 40 [2018-09-30 21:15:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:15:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 17 states and 18 transitions. [2018-09-30 21:15:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-30 21:15:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 21:15:31,733 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:15:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:15:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:15:45,991 WARN L178 SmtUtils]: Spent 4.36 s on a formula simplification that was a NOOP. DAG size: 45 [2018-09-30 21:16:00,212 WARN L178 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 46 [2018-09-30 21:16:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:16:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-09-30 21:16:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-30 21:16:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 21:16:01,538 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:16:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:16:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:16:51,367 WARN L178 SmtUtils]: Spent 10.39 s on a formula simplification that was a NOOP. DAG size: 51 [2018-09-30 21:17:05,092 WARN L178 SmtUtils]: Spent 3.79 s on a formula simplification that was a NOOP. DAG size: 52 [2018-09-30 21:17:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:17:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 21:17:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 21:17:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 21:17:06,098 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:17:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:17:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:17:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:17:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:17:06,248 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-09-30 21:17:06,296 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 30.09 09:17:06 ImpRootNode [2018-09-30 21:17:06,297 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-09-30 21:17:06,298 INFO L168 Benchmark]: Toolchain (without parser) took 159511.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 211.4 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. [2018-09-30 21:17:06,300 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 21:17:06,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 21:17:06,301 INFO L168 Benchmark]: Boogie Preprocessor took 21.83 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 21:17:06,302 INFO L168 Benchmark]: RCFGBuilder took 313.98 ms. Allocated memory is still 1.6 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-09-30 21:17:06,303 INFO L168 Benchmark]: CodeCheck took 159124.69 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-09-30 21:17:06,308 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, 159.0s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 764 SDslu, 1272 SDs, 0 SdLazy, 2290 SolverSat, 1274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.2s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 9936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/168 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: 45]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 38, overapproximation of bitwiseAnd at line 39. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_~i~5, main_~bit~5, main_~x~4, main_~y~4, main_~c~4; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L24] assume true; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L29] assume !(main_~c~4 % 256 < 8); [L30] __VERIFIER_assert_#in~cond := (if main_~x~4 % 256 == main_~y~4 % 256 then 1 else 0); [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; [L34] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L45] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=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.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.83 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 313.98 ms. Allocated memory is still 1.6 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 159124.69 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 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/num_conversion_1.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-09-30_21-17-06-322.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-09-30_21-17-06-322.csv Received shutdown request...