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-133090d [2018-10-04 10:14:50,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 10:14:50,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 10:14:50,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 10:14:50,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 10:14:50,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 10:14:50,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 10:14:50,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 10:14:50,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 10:14:50,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 10:14:50,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 10:14:50,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 10:14:50,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 10:14:50,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 10:14:50,898 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 10:14:50,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 10:14:50,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 10:14:50,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 10:14:50,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 10:14:50,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 10:14:50,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 10:14:50,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 10:14:50,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 10:14:50,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 10:14:50,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 10:14:50,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 10:14:50,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 10:14:50,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 10:14:50,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 10:14:50,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 10:14:50,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 10:14:50,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 10:14:50,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 10:14:50,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 10:14:50,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 10:14:50,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 10:14:50,920 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-10-04 10:14:50,940 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 10:14:50,940 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 10:14:50,941 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 10:14:50,941 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 10:14:50,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 10:14:50,942 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 10:14:50,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 10:14:50,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 10:14:50,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 10:14:50,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 10:14:50,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 10:14:50,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 10:14:50,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 10:14:50,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 10:14:50,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 10:14:50,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 10:14:50,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 10:14:50,945 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 10:14:50,945 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 10:14:50,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 10:14:50,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 10:14:50,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 10:14:50,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 10:14:50,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 10:14:50,946 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 10:14:50,947 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 10:14:50,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 10:14:50,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 10:14:50,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 10:14:51,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 10:14:51,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 10:14:51,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 10:14:51,029 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 10:14:51,029 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 10:14:51,030 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-10-04 10:14:51,030 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl' [2018-10-04 10:14:51,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 10:14:51,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 10:14:51,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 10:14:51,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 10:14:51,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 10:14:51,104 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,118 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 10:14:51,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 10:14:51,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 10:14:51,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 10:14:51,138 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,138 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,139 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,139 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,142 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,144 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,145 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 10:14:51,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 10:14:51,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 10:14:51,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 10:14:51,149 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 04.10 10: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-04 10:14:51,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 10:14:51,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 10:14:51,488 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 10:14:51,489 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:14:51 BoogieIcfgContainer [2018-10-04 10:14:51,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 10:14:51,489 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 10:14:51,490 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 10:14:51,502 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 10:14:51,502 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 04.10 10:14:51" (1/1) ... [2018-10-04 10:14:51,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 10:14:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 10:14:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 10:14:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 10:14:51,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:14:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 10:14:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 10:14:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 10:14:51,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:52,056 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-04 10:14:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-10-04 10:14:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-04 10:14:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:14:52,295 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:53,352 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:14:58,257 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-04 10:14:59,849 WARN L178 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 10:15:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-10-04 10:15:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 10:15:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 10:15:02,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:03,125 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-04 10:15:04,446 WARN L178 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-04 10:15:11,840 WARN L178 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 28 [2018-10-04 10:15:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-10-04 10:15:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-10-04 10:15:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:15:11,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:12,436 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-04 10:15:19,500 WARN L178 SmtUtils]: Spent 3.24 s on a formula simplification that was a NOOP. DAG size: 33 [2018-10-04 10:15:24,390 WARN L178 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-04 10:15:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-10-04 10:15:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 10:15:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:15:26,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:30,311 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-04 10:15:38,672 WARN L178 SmtUtils]: Spent 3.75 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-04 10:15:47,861 WARN L178 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 40 [2018-10-04 10:15:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 17 states and 18 transitions. [2018-10-04 10:15:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-04 10:15:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 10:15:56,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:58,927 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-04 10:16:10,353 WARN L178 SmtUtils]: Spent 4.32 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-04 10:16:24,466 WARN L178 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 46 [2018-10-04 10:16:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:16:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-10-04 10:16:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 10:16:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:16:25,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:16:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:16:43,397 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-04 10:17:22,588 WARN L178 SmtUtils]: Spent 19.87 s on a formula simplification that was a NOOP. DAG size: 51 [2018-10-04 10:17:43,309 WARN L178 SmtUtils]: Spent 3.43 s on a formula simplification that was a NOOP. DAG size: 52 [2018-10-04 10:17:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:17:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 21 states and 22 transitions. [2018-10-04 10:17:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-04 10:17:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 10:17:54,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:17:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:54,548 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 9 iterations. [2018-10-04 10:17:54,612 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 10:17:54 ImpRootNode [2018-10-04 10:17:54,612 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 10:17:54,613 INFO L168 Benchmark]: Toolchain (without parser) took 183533.26 ms. Allocated memory is still 1.5 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-10-04 10:17:54,615 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:17:54,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.56 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:17:54,617 INFO L168 Benchmark]: Boogie Preprocessor took 20.91 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:17:54,617 INFO L168 Benchmark]: RCFGBuilder took 341.80 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-04 10:17:54,618 INFO L168 Benchmark]: CodeCheck took 183122.66 ms. Allocated memory is still 1.5 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-10-04 10:17:54,625 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, 183.0s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 764 SDslu, 1272 SDs, 0 SdLazy, 2286 SolverSat, 1272 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 66.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 504 SyntacticMatches, 56 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 155.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 26.5s 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.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.56 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 20.91 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.80 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 183122.66 ms. Allocated memory is still 1.5 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-10-04_10-17-54-644.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-10-04_10-17-54-644.csv Received shutdown request...