java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/KojakBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 10:17:35,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 10:17:35,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 10:17:35,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 10:17:35,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 10:17:35,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 10:17:35,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 10:17:35,939 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 10:17:35,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 10:17:35,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 10:17:35,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 10:17:35,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 10:17:35,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 10:17:35,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 10:17:35,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 10:17:35,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 10:17:35,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 10:17:35,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 10:17:35,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 10:17:35,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 10:17:35,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 10:17:35,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 10:17:35,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 10:17:35,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 10:17:35,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 10:17:35,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 10:17:35,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 10:17:35,987 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 10:17:35,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 10:17:35,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 10:17:35,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 10:17:35,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 10:17:35,992 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 10:17:35,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 10:17:35,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 10:17:35,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 10:17:35,996 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-03 10:17:36,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 10:17:36,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 10:17:36,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 10:17:36,022 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 10:17:36,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 10:17:36,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 10:17:36,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 10:17:36,023 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 10:17:36,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 10:17:36,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 10:17:36,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 10:17:36,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 10:17:36,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 10:17:36,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 10:17:36,025 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 10:17:36,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 10:17:36,025 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 10:17:36,025 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-03 10:17:36,026 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-03 10:17:36,026 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 10:17:36,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 10:17:36,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 10:17:36,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-03 10:17:36,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 10:17:36,027 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 10:17:36,027 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 10:17:36,028 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-03 10:17:36,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 10:17:36,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 10:17:36,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 10:17:36,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 10:17:36,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 10:17:36,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 10:17:36,098 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 10:17:36,099 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 10:17:36,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl [2018-10-03 10:17:36,101 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl' [2018-10-03 10:17:36,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 10:17:36,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 10:17:36,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 10:17:36,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 10:17:36,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 10:17:36,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 10:17:36,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 10:17:36,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 10:17:36,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 10:17:36,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 10:17:36,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 10:17:36,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 10:17:36,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 10:17:36,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 10:17:36" (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-03 10:17:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 10:17:36,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 10:17:36,595 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 10:17:36,596 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 10:17:36 BoogieIcfgContainer [2018-10-03 10:17:36,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 10:17:36,597 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-03 10:17:36,597 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-03 10:17:36,609 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-03 10:17:36,609 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 10:17:36" (1/1) ... [2018-10-03 10:17:36,622 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 10:17:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:17:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-03 10:17:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-03 10:17:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 10:17:36,666 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:17:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:17:36,841 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-03 10:17:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:17:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-03 10:17:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-03 10:17:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-03 10:17:37,200 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:17:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:17:37,291 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-03 10:17:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:17:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-10-03 10:17:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-03 10:17:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 10:17:37,785 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:17:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:17:37,987 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-03 10:17:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:17:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-10-03 10:17:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-03 10:17:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 10:17:41,038 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:17:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:17:41,265 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-03 10:17:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:17:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-10-03 10:17:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-10-03 10:17:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 10:17:44,632 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:17:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:17:44,846 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-03 10:18:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:18:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-10-03 10:18:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-03 10:18:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 10:18:00,940 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:18:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:18:02,047 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-03 10:18:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:18:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 17 states and 18 transitions. [2018-10-03 10:18:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-03 10:18:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 10:18:11,320 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:18:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:18:11,630 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-03 10:18:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:18:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-10-03 10:18:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-03 10:18:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 10:18:43,108 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:18:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 10:18:44,057 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-03 10:19:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 10:19:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-03 10:19:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-03 10:19:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 10:19:21,424 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 10:19:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 10:19:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 10:19:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 10:19:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-03 10:19:21,610 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-10-03 10:19:21,625 INFO L760 CodeCheckObserver]: 0 DeclaredPredicates, 584 GetRequests, 498 SyntacticMatches, 56 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.1s Time 48.4s impTime 10 [2018-10-03 10:19:21,663 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.10 10:19:21 ImpRootNode [2018-10-03 10:19:21,671 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-03 10:19:21,673 INFO L168 Benchmark]: Toolchain (without parser) took 105503.14 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: 296.1 MB). Peak memory consumption was 296.1 MB. Max. memory is 7.1 GB. [2018-10-03 10:19:21,675 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 10:19:21,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 10:19:21,677 INFO L168 Benchmark]: Boogie Preprocessor took 25.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 10:19:21,678 INFO L168 Benchmark]: RCFGBuilder took 353.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-03 10:19:21,679 INFO L168 Benchmark]: CodeCheck took 105074.79 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: 277.0 MB). Peak memory consumption was 277.0 MB. Max. memory is 7.1 GB. [2018-10-03 10:19:21,689 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, 104.9s 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, 39.1s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s 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: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 39, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~x~5, main_~y~5, main_~c~5; [L17] main_~x~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] havoc main_~y~5; [L20] havoc main_~c~5; [L21] main_~y~5 := 0; [L22] main_~c~5 := 0; VAL [main_~c~5=0, main_~y~5=0] [L25] assume true; VAL [main_~c~5=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~y~5=0] [L30] assume !(main_~c~5 % 256 < 8); [L31] __VERIFIER_assert_#in~cond := (if main_~x~5 % 256 == main_~y~5 % 256 then 1 else 0); [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; [L35] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 353.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * CodeCheck took 105074.79 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: 277.0 MB). Peak memory consumption was 277.0 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_2.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-03_10-19-21-705.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-03_10-19-21-705.csv Received shutdown request...