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/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 01:51:43,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 01:51:43,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 01:51:43,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 01:51:43,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 01:51:44,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 01:51:44,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 01:51:44,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 01:51:44,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 01:51:44,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 01:51:44,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 01:51:44,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 01:51:44,011 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 01:51:44,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 01:51:44,013 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 01:51:44,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 01:51:44,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 01:51:44,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 01:51:44,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 01:51:44,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 01:51:44,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 01:51:44,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 01:51:44,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 01:51:44,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 01:51:44,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 01:51:44,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 01:51:44,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 01:51:44,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 01:51:44,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 01:51:44,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 01:51:44,041 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 01:51:44,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 01:51:44,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 01:51:44,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 01:51:44,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 01:51:44,047 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 01:51:44,047 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-01 01:51:44,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 01:51:44,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 01:51:44,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 01:51:44,077 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 01:51:44,078 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 01:51:44,078 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 01:51:44,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 01:51:44,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 01:51:44,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 01:51:44,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 01:51:44,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 01:51:44,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 01:51:44,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 01:51:44,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 01:51:44,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 01:51:44,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 01:51:44,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 01:51:44,080 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-01 01:51:44,080 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-01 01:51:44,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 01:51:44,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 01:51:44,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 01:51:44,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 01:51:44,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 01:51:44,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 01:51:44,082 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-01 01:51:44,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 01:51:44,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 01:51:44,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 01:51:44,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 01:51:44,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 01:51:44,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 01:51:44,168 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 01:51:44,169 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 01:51:44,170 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl [2018-10-01 01:51:44,170 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl' [2018-10-01 01:51:44,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 01:51:44,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 01:51:44,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 01:51:44,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 01:51:44,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 01:51:44,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 01:51:44,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 01:51:44,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 01:51:44,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 01:51:44,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 01:51:44,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 01:51:44,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 01:51:44,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 01:51:44,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:51:44" (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-01 01:51:44,368 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 01:51:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 01:51:44,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 01:51:44,616 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 01:51:44,616 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:51:44 BoogieIcfgContainer [2018-10-01 01:51:44,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 01:51:44,617 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-01 01:51:44,617 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-01 01:51:44,630 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-01 01:51:44,630 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:51:44" (1/1) ... [2018-10-01 01:51:44,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 01:51:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-01 01:51:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-01 01:51:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 01:51:44,695 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:44,849 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-01 01:51:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 5 states and 6 transitions. [2018-10-01 01:51:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2018-10-01 01:51:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 01:51:44,997 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 6 states and 7 transitions. [2018-10-01 01:51:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-01 01:51:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 01:51:45,246 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 9 states and 12 transitions. [2018-10-01 01:51:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-01 01:51:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 01:51:46,339 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:46,633 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-01 01:51:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2018-10-01 01:51:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-01 01:51:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 01:51:47,159 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 14 states and 19 transitions. [2018-10-01 01:51:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-01 01:51:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 01:51:47,609 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 15 states and 20 transitions. [2018-10-01 01:51:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2018-10-01 01:51:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 01:51:47,841 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 17 states and 23 transitions. [2018-10-01 01:51:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2018-10-01 01:51:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 01:51:48,534 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-10-01 01:51:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-10-01 01:51:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 01:51:48,750 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-10-01 01:51:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-10-01 01:51:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 01:51:49,199 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:49,437 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-01 01:51:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-10-01 01:51:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-10-01 01:51:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 01:51:49,549 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 23 states and 31 transitions. [2018-10-01 01:51:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-10-01 01:51:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 01:51:50,007 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:51:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:51:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:51:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 24 states and 32 transitions. [2018-10-01 01:51:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2018-10-01 01:51:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 01:51:50,353 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:51:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 01:51:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 01:51:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 01:51:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 01:51:50,611 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-10-01 01:51:50,636 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.10 01:51:50 ImpRootNode [2018-10-01 01:51:50,637 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-01 01:51:50,638 INFO L168 Benchmark]: Toolchain (without parser) took 6416.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 995.7 MB in the end (delta: 449.5 MB). Peak memory consumption was 449.5 MB. Max. memory is 7.1 GB. [2018-10-01 01:51:50,639 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-01 01:51:50,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.85 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-01 01:51:50,640 INFO L168 Benchmark]: Boogie Preprocessor took 23.64 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-01 01:51:50,641 INFO L168 Benchmark]: RCFGBuilder took 322.84 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 01:51:50,642 INFO L168 Benchmark]: CodeCheck took 6019.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 995.7 MB in the end (delta: 428.4 MB). Peak memory consumption was 428.4 MB. Max. memory is 7.1 GB. [2018-10-01 01:51:50,646 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 5.9s OverallTime, 13 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2048 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 45722 SolverSat, 32074 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 0/158 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 47]: assertion can be violated assertion can be violated We found a FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~c~5, main_~x~5, main_~y~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] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=2, main_~y~5=2] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~y~5=257] [L29] assume main_~c~5 < 256 && !(main_~c~5 < 8); [L30] assume (((!(main_~x~5 + 256 == main_~y~5 - 256) && -256 <= main_~x~5) && main_~y~5 < 256 + 256) && 256 <= main_~y~5) && main_~x~5 < 0; [L31] __VERIFIER_assert_#in~cond := 0; [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-256, main_~y~5=257] [L47] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-256, main_~y~5=257] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 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 44.85 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 23.64 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 322.84 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 6019.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 995.7 MB in the end (delta: 428.4 MB). Peak memory consumption was 428.4 MB. Max. memory is 7.1 GB. RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-01_01-51-50-661.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-01_01-51-50-661.csv Received shutdown request...