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/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 13:24:38,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 13:24:38,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 13:24:38,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 13:24:38,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 13:24:38,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 13:24:38,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 13:24:38,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 13:24:38,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 13:24:38,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 13:24:38,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 13:24:38,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 13:24:38,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 13:24:38,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 13:24:38,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 13:24:38,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 13:24:38,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 13:24:38,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 13:24:38,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 13:24:38,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 13:24:38,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 13:24:38,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 13:24:38,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 13:24:38,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 13:24:38,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 13:24:38,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 13:24:38,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 13:24:38,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 13:24:38,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 13:24:38,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 13:24:38,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 13:24:38,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 13:24:38,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 13:24:38,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 13:24:38,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 13:24:38,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 13:24:38,910 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 13:24:38,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 13:24:38,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 13:24:38,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 13:24:38,928 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 13:24:38,928 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 13:24:38,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 13:24:38,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 13:24:38,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 13:24:38,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 13:24:38,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 13:24:38,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 13:24:38,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 13:24:38,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 13:24:38,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 13:24:38,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 13:24:38,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 13:24:38,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 13:24:38,931 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 13:24:38,931 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 13:24:38,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 13:24:38,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 13:24:38,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 13:24:38,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 13:24:38,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 13:24:38,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 13:24:38,932 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 13:24:38,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 13:24:38,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 13:24:38,933 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 13:24:38,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 13:24:39,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 13:24:39,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 13:24:39,018 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 13:24:39,018 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 13:24:39,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2018-10-04 13:24:39,020 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2018-10-04 13:24:39,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 13:24:39,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 13:24:39,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 13:24:39,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 13:24:39,090 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 13:24:39,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 13:24:39,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 13:24:39,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 13:24:39,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 13:24:39,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 13:24:39,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 13:24:39,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 13:24:39,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 13:24:39,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:39" (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 13:24:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 13:24:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 13:24:39,511 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 13:24:39,513 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:24:39 BoogieIcfgContainer [2018-10-04 13:24:39,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 13:24:39,517 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 13:24:39,518 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 13:24:39,556 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 13:24:39,557 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:24:39" (1/1) ... [2018-10-04 13:24:39,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 13:24:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 13:24:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 13:24:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 13:24:39,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:39,888 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 13:24:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 7 states and 10 transitions. [2018-10-04 13:24:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2018-10-04 13:24:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 13:24:40,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:40,454 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 13:24:40,651 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-04 13:24:40,798 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-04 13:24:40,973 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 13:24:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-10-04 13:24:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-04 13:24:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 13:24:41,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:41,818 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 13:24:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-10-04 13:24:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 13:24:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 13:24:42,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:43,124 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 13:24:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-10-04 13:24:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-10-04 13:24:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 13:24:43,777 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:43,972 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 13:24:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-10-04 13:24:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 13:24:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 13:24:44,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:45,253 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 13:24:45,596 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-10-04 13:24:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 17 states and 18 transitions. [2018-10-04 13:24:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-04 13:24:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 13:24:46,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:47,441 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 13:24:47,783 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-10-04 13:24:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-10-04 13:24:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 13:24:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 13:24:48,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:49,643 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 13:24:50,328 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-04 13:24:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 21 states and 22 transitions. [2018-10-04 13:24:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-04 13:24:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 13:24:50,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:52,416 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2018-10-04 13:24:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:24:52,941 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-10-04 13:24:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 23 states and 24 transitions. [2018-10-04 13:24:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-04 13:24:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 13:24:54,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:24:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 25 states and 26 transitions. [2018-10-04 13:24:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-10-04 13:24:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:24:56,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:56,499 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 11 iterations. [2018-10-04 13:24:56,554 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 01:24:56 ImpRootNode [2018-10-04 13:24:56,554 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 13:24:56,556 INFO L168 Benchmark]: Toolchain (without parser) took 17469.37 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 122.7 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 284.5 MB). Peak memory consumption was 407.2 MB. Max. memory is 7.1 GB. [2018-10-04 13:24:56,557 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 13:24:56,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.84 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 13:24:56,559 INFO L168 Benchmark]: Boogie Preprocessor took 23.78 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 13:24:56,559 INFO L168 Benchmark]: RCFGBuilder took 358.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 13:24:56,560 INFO L168 Benchmark]: CodeCheck took 17037.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 122.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 263.3 MB). Peak memory consumption was 386.0 MB. Max. memory is 7.1 GB. [2018-10-04 13:24:56,565 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, 9 locations, 1 error locations. UNSAFE Result, 16.8s OverallTime, 11 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 3066 SDslu, 1024 SDs, 0 SdLazy, 20456 SolverSat, 7162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1025 GetRequests, 793 SyntacticMatches, 124 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7713 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 31584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 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: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; [L17] main_~loop1~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~n1~5 := main_#t~nondet1; [L20] havoc main_#t~nondet1; [L21] main_~x~5 := 0; VAL [main_~sn~5=0, main_~x~5=0] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L24] assume true; [L25] assume !false; [L34] assume !(main_~x~5 % 4294967296 < 10); [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 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.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.78 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 358.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 17037.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 122.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 263.3 MB). Peak memory consumption was 386.0 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/sum03.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-04_13-24-56-579.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-04_13-24-56-579.csv Received shutdown request...