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/gcd_2.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:38:28,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:38:28,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:38:28,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:38:28,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:38:28,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:38:28,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:38:28,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:38:28,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:38:28,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:38:28,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:38:28,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:38:28,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:38:28,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:38:28,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:38:29,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:38:29,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:38:29,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:38:29,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:38:29,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:38:29,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:38:29,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:38:29,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:38:29,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:38:29,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:38:29,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:38:29,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:38:29,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:38:29,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:38:29,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:38:29,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:38:29,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:38:29,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:38:29,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:38:29,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:38:29,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:38:29,043 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-03 09:38:29,066 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:38:29,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:38:29,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:38:29,068 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:38:29,068 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:38:29,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:38:29,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:38:29,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:38:29,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:38:29,069 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:38:29,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:38:29,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:38:29,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:38:29,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:38:29,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:38:29,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:38:29,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:38:29,071 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-03 09:38:29,071 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-03 09:38:29,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:38:29,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:38:29,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-03 09:38:29,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:38:29,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:38:29,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:38:29,073 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-03 09:38:29,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:38:29,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:38:29,073 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:38:29,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:38:29,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:38:29,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:38:29,135 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:38:29,136 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:38:29,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gcd_2.i_4.bpl [2018-10-03 09:38:29,137 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gcd_2.i_4.bpl' [2018-10-03 09:38:29,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:38:29,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:38:29,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:38:29,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:38:29,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:38:29,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:38:29,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:38:29,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:38:29,253 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:38:29,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:38:29,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:38:29,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:38:29,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:38:29,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:38:29" (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 09:38:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:38:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:38:29,648 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:38:29,649 INFO L202 PluginConnector]: Adding new model gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:38:29 BoogieIcfgContainer [2018-10-03 09:38:29,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:38:29,650 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-03 09:38:29,650 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-03 09:38:29,662 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-03 09:38:29,662 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:38:29" (1/1) ... [2018-10-03 09:38:29,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 09:38:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 09:38:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-03 09:38:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-03 09:38:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 09:38:29,723 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 09:38:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:38:29,897 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 09:38:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 09:38:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-10-03 09:38:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-03 09:38:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-03 09:38:30,121 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 09:38:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:38:30,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:38:30,251 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 09:38:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 09:38:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 9 states and 13 transitions. [2018-10-03 09:38:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2018-10-03 09:38:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:38:30,765 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 09:38:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:38:30,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:38:53,828 WARN L178 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 457 DAG size of output: 25 [2018-10-03 09:38:53,951 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 09:39:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-03 09:39:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 13 states and 23 transitions. [2018-10-03 09:39:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-10-03 09:39:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 09:39:31,496 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-03 09:39:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:39:31,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:40:38,462 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 36 [2018-10-03 09:40:48,574 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 0 c_ULTIMATE.start_main_~y~7)) (.cse5 (<= c_ULTIMATE.start_main_~y~7 127)) (.cse6 (not (= c_ULTIMATE.start_main_~y~7 0)))) (or (and .cse0 (exists ((v_prenex_121 Int) (v_prenex_120 Int)) (let ((.cse2 (mod v_prenex_121 c_ULTIMATE.start_main_~y~7))) (let ((.cse1 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse2) 256))) (let ((.cse3 (mod v_prenex_120 (+ .cse1 (- 256))))) (let ((.cse4 (mod .cse3 256))) (and (< v_prenex_121 0) (not (= .cse1 256)) (not (= .cse2 0)) (< 127 .cse1) (<= 256 .cse1) (= 0 .cse3) (<= .cse4 127) (<= c_ULTIMATE.start_gcd_test_~b .cse4) (<= c_ULTIMATE.start_main_~y~7 v_prenex_120))))))) .cse5 .cse6) (and .cse0 (exists ((v_prenex_68 Int) (v_prenex_51 Int)) (let ((.cse8 (mod v_prenex_51 c_ULTIMATE.start_main_~y~7))) (let ((.cse7 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse8) 256))) (let ((.cse9 (mod (mod v_prenex_68 (+ .cse7 (- 256))) 256))) (and (< 127 .cse7) (not (= .cse8 0)) (< 127 .cse9) (< v_prenex_51 0) (not (= 256 .cse7)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_68) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse9) (<= 0 v_prenex_68) (< .cse7 256)))))) .cse5 .cse6) (and .cse0 .cse5 .cse6 (exists ((v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse13 (mod v_prenex_83 c_ULTIMATE.start_main_~y~7))) (let ((.cse10 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse13) 256))) (let ((.cse12 (mod v_prenex_82 (+ .cse10 (- 256))))) (let ((.cse11 (mod (+ (* 255 .cse10) .cse12) 256))) (and (not (= 256 .cse10)) (<= c_ULTIMATE.start_gcd_test_~b .cse11) (<= c_ULTIMATE.start_main_~y~7 v_prenex_82) (< 127 .cse10) (< v_prenex_83 0) (not (= .cse12 0)) (not (= .cse13 0)) (< v_prenex_82 0) (<= 256 .cse10) (<= .cse11 127)))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse15 (mod v_prenex_92 c_ULTIMATE.start_main_~y~7))) (let ((.cse16 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse15) 256))) (let ((.cse17 (mod v_prenex_91 (+ .cse16 (- 256))))) (let ((.cse14 (mod (+ (* 255 .cse16) .cse17) 256))) (and (< 127 .cse14) (not (= .cse15 0)) (<= 256 .cse16) (< v_prenex_92 0) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse14) (< 127 .cse16) (not (= .cse17 0)) (< v_prenex_91 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_91) (not (= .cse16 256))))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_85 Int) (v_prenex_86 Int)) (let ((.cse21 (mod v_prenex_86 c_ULTIMATE.start_main_~y~7))) (let ((.cse18 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse21) 256))) (let ((.cse19 (mod v_prenex_85 (+ .cse18 (- 256))))) (let ((.cse20 (mod .cse19 256))) (and (< v_prenex_86 0) (< 127 .cse18) (= 0 .cse19) (<= c_ULTIMATE.start_main_~y~7 v_prenex_85) (not (= 256 .cse18)) (< 127 .cse20) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse20) (not (= .cse21 0)) (< .cse18 256)))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse22 (mod (mod v_prenex_60 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse24 (mod v_prenex_59 .cse22))) (let ((.cse23 (mod (+ (* 255 .cse22) .cse24) 256))) (and (<= .cse22 127) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse23) (< v_prenex_59 0) (<= 0 .cse22) (not (= 0 .cse24)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_59) (<= 0 v_prenex_60) (not (= .cse22 0)) (< 127 .cse23))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_63 Int) (v_prenex_62 Int)) (let ((.cse26 (mod (mod v_prenex_63 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse25 (mod (mod v_prenex_62 .cse26) 256))) (and (<= .cse25 127) (<= .cse26 127) (<= 0 v_prenex_63) (not (= .cse26 0)) (<= 0 v_prenex_62) (<= c_ULTIMATE.start_main_~y~7 v_prenex_62) (<= 0 .cse26) (<= c_ULTIMATE.start_gcd_test_~b .cse25)))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse27 (mod (mod v_prenex_80 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse29 (mod v_prenex_79 .cse27))) (let ((.cse28 (mod .cse29 256))) (and (<= 0 .cse27) (<= 0 v_prenex_80) (<= c_ULTIMATE.start_main_~y~7 v_prenex_79) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse28) (< 127 .cse28) (<= .cse27 127) (= .cse29 0) (not (= .cse27 0)))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse31 (mod v_prenex_118 c_ULTIMATE.start_main_~y~7))) (let ((.cse30 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse31) 256))) (let ((.cse32 (mod (mod v_prenex_117 (+ .cse30 (- 256))) 256))) (and (< 127 .cse30) (not (= .cse31 0)) (<= .cse32 127) (<= 256 .cse30) (<= 0 v_prenex_117) (<= c_ULTIMATE.start_main_~y~7 v_prenex_117) (< v_prenex_118 0) (not (= .cse30 256)) (<= c_ULTIMATE.start_gcd_test_~b .cse32))))))) (and .cse0 .cse5 (exists ((v_prenex_95 Int) (v_prenex_94 Int)) (let ((.cse33 (mod (mod v_prenex_95 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse35 (mod v_prenex_94 .cse33))) (let ((.cse34 (mod (+ .cse35 .cse33) 256))) (and (< .cse33 0) (< 127 .cse34) (not (= .cse33 0)) (<= 0 v_prenex_95) (<= .cse33 127) (not (= .cse35 0)) (< v_prenex_94 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_94) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse34)))))) .cse6) (and .cse0 .cse5 (exists ((v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse37 (mod (mod v_prenex_113 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse36 (mod (mod v_prenex_111 .cse37) 256))) (and (< 127 .cse36) (<= 0 v_prenex_113) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse36) (<= .cse37 127) (< .cse37 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_111) (<= 0 v_prenex_111) (not (= 0 .cse37)))))) .cse6) (and .cse0 .cse5 .cse6 (exists ((v_prenex_70 Int) (v_prenex_71 Int)) (let ((.cse40 (mod v_prenex_71 c_ULTIMATE.start_main_~y~7))) (let ((.cse38 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse40) 256))) (let ((.cse39 (mod (mod v_prenex_70 (+ .cse38 (- 256))) 256))) (and (not (= 256 .cse38)) (<= 0 v_prenex_70) (<= c_ULTIMATE.start_main_~y~7 v_prenex_70) (< 127 .cse38) (<= .cse39 127) (< .cse38 256) (not (= .cse40 0)) (<= c_ULTIMATE.start_gcd_test_~b .cse39) (< v_prenex_71 0))))))) (and .cse0 .cse5 .cse6 (exists ((v_prenex_109 Int) (v_prenex_108 Int)) (let ((.cse42 (mod v_prenex_109 c_ULTIMATE.start_main_~y~7))) (let ((.cse43 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse42) 256))) (let ((.cse41 (mod v_prenex_108 (+ .cse43 (- 256))))) (let ((.cse44 (mod .cse41 256))) (and (= 0 .cse41) (not (= .cse42 0)) (< v_prenex_109 0) (not (= .cse43 256)) (< .cse43 256) (<= c_ULTIMATE.start_main_~y~7 v_prenex_108) (<= c_ULTIMATE.start_gcd_test_~b .cse44) (< 127 .cse43) (<= .cse44 127)))))))) (and .cse0 (exists ((v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse48 (mod v_prenex_98 c_ULTIMATE.start_main_~y~7))) (let ((.cse46 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse48) 256))) (let ((.cse45 (mod v_prenex_97 (+ .cse46 (- 256))))) (let ((.cse47 (mod .cse45 256))) (and (= .cse45 0) (not (= 256 .cse46)) (< v_prenex_98 0) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse47) (<= 256 .cse46) (<= c_ULTIMATE.start_main_~y~7 v_prenex_97) (< 127 .cse47) (not (= .cse48 0)) (< 127 .cse46))))))) .cse5 .cse6) (and .cse0 (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse49 (mod (mod v_prenex_66 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse51 (mod v_prenex_65 .cse49))) (let ((.cse50 (mod (+ (* 255 .cse49) .cse51) 256))) (and (<= 0 .cse49) (<= c_ULTIMATE.start_gcd_test_~b .cse50) (<= .cse50 127) (<= 0 v_prenex_66) (< v_prenex_65 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_65) (not (= .cse49 0)) (<= .cse49 127) (not (= .cse51 0))))))) .cse5 .cse6) (and .cse0 (exists ((v_ULTIMATE.start_gcd_test_~a_9 Int) (v_prenex_47 Int)) (let ((.cse53 (mod (mod v_prenex_47 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse52 (mod v_ULTIMATE.start_gcd_test_~a_9 .cse53))) (let ((.cse54 (mod .cse52 256))) (and (= 0 .cse52) (not (= .cse53 0)) (<= c_ULTIMATE.start_main_~y~7 v_ULTIMATE.start_gcd_test_~a_9) (<= 0 v_prenex_47) (<= .cse53 127) (<= .cse54 127) (<= c_ULTIMATE.start_gcd_test_~b .cse54) (< .cse53 0)))))) .cse5 .cse6) (and .cse0 (exists ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse57 (mod v_prenex_124 c_ULTIMATE.start_main_~y~7))) (let ((.cse55 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse57) 256))) (let ((.cse56 (mod (mod v_prenex_123 (+ .cse55 (- 256))) 256))) (and (not (= .cse55 256)) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse56) (< v_prenex_124 0) (<= 0 v_prenex_123) (not (= .cse57 0)) (<= 256 .cse55) (< 127 .cse56) (< 127 .cse55) (<= c_ULTIMATE.start_main_~y~7 v_prenex_123)))))) .cse5 .cse6) (and .cse0 .cse5 (exists ((v_prenex_74 Int) (v_prenex_73 Int)) (let ((.cse61 (mod v_prenex_74 c_ULTIMATE.start_main_~y~7))) (let ((.cse58 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse61) 256))) (let ((.cse60 (mod v_prenex_73 (+ .cse58 (- 256))))) (let ((.cse59 (mod (+ .cse58 .cse60) 256))) (and (not (= 256 .cse58)) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse59) (< 127 .cse58) (not (= .cse60 0)) (< 127 .cse59) (< v_prenex_74 0) (< v_prenex_73 0) (not (= .cse61 0)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_73) (< .cse58 256))))))) .cse6) (and .cse0 .cse5 (exists ((v_prenex_77 Int) (v_prenex_76 Int)) (let ((.cse62 (mod (mod v_prenex_77 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse64 (mod v_prenex_76 .cse62))) (let ((.cse63 (mod (+ .cse62 .cse64) 256))) (and (<= .cse62 127) (<= 0 v_prenex_77) (<= c_ULTIMATE.start_main_~y~7 v_prenex_76) (< .cse62 0) (<= c_ULTIMATE.start_gcd_test_~b .cse63) (<= .cse63 127) (< v_prenex_76 0) (not (= .cse64 0)) (not (= 0 .cse62))))))) .cse6) (and .cse0 (exists ((v_prenex_101 Int) (v_prenex_100 Int)) (let ((.cse66 (mod (mod v_prenex_101 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse65 (mod (mod v_prenex_100 .cse66) 256))) (and (<= c_ULTIMATE.start_gcd_test_~b .cse65) (<= .cse66 127) (<= 0 v_prenex_101) (not (= 0 .cse66)) (<= 0 v_prenex_100) (<= .cse65 127) (<= c_ULTIMATE.start_main_~y~7 v_prenex_100) (< .cse66 0))))) .cse5 .cse6) (and (exists ((v_prenex_89 Int) (v_prenex_88 Int)) (let ((.cse67 (mod (mod v_prenex_89 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse68 (mod v_prenex_88 .cse67))) (let ((.cse69 (mod .cse68 256))) (and (<= c_ULTIMATE.start_main_~y~7 v_prenex_88) (not (= .cse67 0)) (= .cse68 0) (< .cse67 0) (<= 0 v_prenex_89) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse69) (<= .cse67 127) (< 127 .cse69)))))) .cse0 .cse5 .cse6) (and .cse0 (exists ((v_prenex_104 Int) (v_prenex_102 Int)) (let ((.cse71 (mod (mod v_prenex_104 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse70 (mod (mod v_prenex_102 .cse71) 256))) (and (< 127 .cse70) (<= 0 .cse71) (<= .cse71 127) (<= (+ c_ULTIMATE.start_gcd_test_~b 256) .cse70) (not (= 0 .cse71)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_102) (<= 0 v_prenex_102) (<= 0 v_prenex_104))))) .cse5 .cse6) (and .cse0 .cse5 (exists ((v_prenex_114 Int) (v_prenex_115 Int)) (let ((.cse75 (mod v_prenex_115 c_ULTIMATE.start_main_~y~7))) (let ((.cse73 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse75) 256))) (let ((.cse72 (mod v_prenex_114 (+ .cse73 (- 256))))) (let ((.cse74 (mod (+ .cse73 .cse72) 256))) (and (< v_prenex_115 0) (not (= 0 .cse72)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_114) (< 127 .cse73) (<= c_ULTIMATE.start_gcd_test_~b .cse74) (not (= .cse73 256)) (< .cse73 256) (not (= .cse75 0)) (< v_prenex_114 0) (<= .cse74 127))))))) .cse6) (and .cse0 (exists ((v_prenex_105 Int) (v_prenex_107 Int)) (let ((.cse76 (mod (mod v_prenex_107 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse77 (mod v_prenex_105 .cse76))) (let ((.cse78 (mod .cse77 256))) (and (not (= 0 .cse76)) (= .cse77 0) (<= c_ULTIMATE.start_gcd_test_~b .cse78) (<= 0 v_prenex_107) (<= .cse78 127) (<= .cse76 127) (<= c_ULTIMATE.start_main_~y~7 v_prenex_105) (<= 0 .cse76)))))) .cse5 .cse6))) is different from false [2018-10-03 09:40:58,745 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 0 c_ULTIMATE.start_main_~y~7)) (.cse1 (<= c_ULTIMATE.start_main_~y~7 127)) (.cse4 (not (= c_ULTIMATE.start_main_~y~7 0)))) (or (and .cse0 .cse1 (exists ((v_prenex_63 Int) (v_prenex_62 Int)) (let ((.cse3 (mod (mod v_prenex_63 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse2 (mod (mod v_prenex_62 .cse3) 256))) (and (<= .cse2 127) (<= .cse3 127) (<= 0 v_prenex_63) (not (= .cse3 0)) (<= 0 v_prenex_62) (<= c_ULTIMATE.start_main_~y~7 v_prenex_62) (<= c_ULTIMATE.start_gcd_test_~a .cse2) (<= 0 .cse3))))) .cse4) (and .cse0 .cse1 (exists ((v_prenex_83 Int) (v_prenex_82 Int)) (let ((.cse7 (mod v_prenex_83 c_ULTIMATE.start_main_~y~7))) (let ((.cse5 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse7) 256))) (let ((.cse6 (mod v_prenex_82 (+ .cse5 (- 256))))) (let ((.cse8 (mod (+ (* 255 .cse5) .cse6) 256))) (and (not (= 256 .cse5)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_82) (< 127 .cse5) (< v_prenex_83 0) (not (= .cse6 0)) (not (= .cse7 0)) (<= c_ULTIMATE.start_gcd_test_~a .cse8) (< v_prenex_82 0) (<= 256 .cse5) (<= .cse8 127))))))) .cse4) (and .cse0 .cse1 .cse4 (exists ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse10 (mod v_prenex_124 c_ULTIMATE.start_main_~y~7))) (let ((.cse9 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse10) 256))) (let ((.cse11 (mod (mod v_prenex_123 (+ .cse9 (- 256))) 256))) (and (not (= .cse9 256)) (< v_prenex_124 0) (<= 0 v_prenex_123) (not (= .cse10 0)) (<= 256 .cse9) (< 127 .cse11) (< 127 .cse9) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse11) (<= c_ULTIMATE.start_main_~y~7 v_prenex_123))))))) (and .cse0 .cse1 .cse4 (exists ((v_ULTIMATE.start_gcd_test_~a_9 Int) (v_prenex_47 Int)) (let ((.cse13 (mod (mod v_prenex_47 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse12 (mod v_ULTIMATE.start_gcd_test_~a_9 .cse13))) (let ((.cse14 (mod .cse12 256))) (and (= 0 .cse12) (not (= .cse13 0)) (<= c_ULTIMATE.start_main_~y~7 v_ULTIMATE.start_gcd_test_~a_9) (<= 0 v_prenex_47) (<= .cse13 127) (<= c_ULTIMATE.start_gcd_test_~a .cse14) (<= .cse14 127) (< .cse13 0))))))) (and (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse15 (mod (mod v_prenex_60 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse17 (mod v_prenex_59 .cse15))) (let ((.cse16 (mod (+ (* 255 .cse15) .cse17) 256))) (and (<= .cse15 127) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse16) (< v_prenex_59 0) (<= 0 .cse15) (not (= 0 .cse17)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_59) (<= 0 v_prenex_60) (not (= .cse15 0)) (< 127 .cse16)))))) .cse0 .cse1 .cse4) (and .cse0 .cse1 (exists ((v_prenex_95 Int) (v_prenex_94 Int)) (let ((.cse18 (mod (mod v_prenex_95 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse20 (mod v_prenex_94 .cse18))) (let ((.cse19 (mod (+ .cse20 .cse18) 256))) (and (< .cse18 0) (< 127 .cse19) (not (= .cse18 0)) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse19) (<= 0 v_prenex_95) (<= .cse18 127) (not (= .cse20 0)) (< v_prenex_94 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_94)))))) .cse4) (and .cse0 .cse1 .cse4 (exists ((v_prenex_113 Int) (v_prenex_111 Int)) (let ((.cse22 (mod (mod v_prenex_113 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse21 (mod (mod v_prenex_111 .cse22) 256))) (and (< 127 .cse21) (<= 0 v_prenex_113) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse21) (<= .cse22 127) (< .cse22 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_111) (<= 0 v_prenex_111) (not (= 0 .cse22))))))) (and .cse0 .cse1 (exists ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse23 (mod (mod v_prenex_80 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse25 (mod v_prenex_79 .cse23))) (let ((.cse24 (mod .cse25 256))) (and (<= 0 .cse23) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse24) (<= 0 v_prenex_80) (<= c_ULTIMATE.start_main_~y~7 v_prenex_79) (< 127 .cse24) (<= .cse23 127) (= .cse25 0) (not (= .cse23 0))))))) .cse4) (and .cse0 .cse1 .cse4 (exists ((v_prenex_114 Int) (v_prenex_115 Int)) (let ((.cse29 (mod v_prenex_115 c_ULTIMATE.start_main_~y~7))) (let ((.cse27 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse29) 256))) (let ((.cse26 (mod v_prenex_114 (+ .cse27 (- 256))))) (let ((.cse28 (mod (+ .cse27 .cse26) 256))) (and (< v_prenex_115 0) (not (= 0 .cse26)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_114) (< 127 .cse27) (<= c_ULTIMATE.start_gcd_test_~a .cse28) (not (= .cse27 256)) (< .cse27 256) (not (= .cse29 0)) (< v_prenex_114 0) (<= .cse28 127)))))))) (and .cse0 .cse1 .cse4 (exists ((v_prenex_101 Int) (v_prenex_100 Int)) (let ((.cse31 (mod (mod v_prenex_101 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse30 (mod (mod v_prenex_100 .cse31) 256))) (and (<= c_ULTIMATE.start_gcd_test_~a .cse30) (<= .cse31 127) (<= 0 v_prenex_101) (not (= 0 .cse31)) (<= 0 v_prenex_100) (<= .cse30 127) (<= c_ULTIMATE.start_main_~y~7 v_prenex_100) (< .cse31 0)))))) (and .cse0 .cse1 .cse4 (exists ((v_prenex_68 Int) (v_prenex_51 Int)) (let ((.cse34 (mod v_prenex_51 c_ULTIMATE.start_main_~y~7))) (let ((.cse33 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse34) 256))) (let ((.cse32 (mod (mod v_prenex_68 (+ .cse33 (- 256))) 256))) (and (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse32) (< 127 .cse33) (not (= .cse34 0)) (< 127 .cse32) (< v_prenex_51 0) (not (= 256 .cse33)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_68) (<= 0 v_prenex_68) (< .cse33 256))))))) (and .cse0 (exists ((v_prenex_85 Int) (v_prenex_86 Int)) (let ((.cse38 (mod v_prenex_86 c_ULTIMATE.start_main_~y~7))) (let ((.cse35 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse38) 256))) (let ((.cse36 (mod v_prenex_85 (+ .cse35 (- 256))))) (let ((.cse37 (mod .cse36 256))) (and (< v_prenex_86 0) (< 127 .cse35) (= 0 .cse36) (<= c_ULTIMATE.start_main_~y~7 v_prenex_85) (not (= 256 .cse35)) (< 127 .cse37) (not (= .cse38 0)) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse37) (< .cse35 256))))))) .cse1 .cse4) (and .cse0 .cse1 .cse4 (exists ((v_prenex_70 Int) (v_prenex_71 Int)) (let ((.cse41 (mod v_prenex_71 c_ULTIMATE.start_main_~y~7))) (let ((.cse39 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse41) 256))) (let ((.cse40 (mod (mod v_prenex_70 (+ .cse39 (- 256))) 256))) (and (not (= 256 .cse39)) (<= 0 v_prenex_70) (<= c_ULTIMATE.start_main_~y~7 v_prenex_70) (< 127 .cse39) (<= .cse40 127) (< .cse39 256) (not (= .cse41 0)) (<= c_ULTIMATE.start_gcd_test_~a .cse40) (< v_prenex_71 0))))))) (and .cse0 (exists ((v_prenex_89 Int) (v_prenex_88 Int)) (let ((.cse43 (mod (mod v_prenex_89 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse44 (mod v_prenex_88 .cse43))) (let ((.cse42 (mod .cse44 256))) (and (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse42) (<= c_ULTIMATE.start_main_~y~7 v_prenex_88) (not (= .cse43 0)) (= .cse44 0) (< .cse43 0) (<= 0 v_prenex_89) (<= .cse43 127) (< 127 .cse42)))))) .cse1 .cse4) (and .cse0 .cse1 (exists ((v_prenex_105 Int) (v_prenex_107 Int)) (let ((.cse46 (mod (mod v_prenex_107 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse47 (mod v_prenex_105 .cse46))) (let ((.cse45 (mod .cse47 256))) (and (<= c_ULTIMATE.start_gcd_test_~a .cse45) (not (= 0 .cse46)) (= .cse47 0) (<= 0 v_prenex_107) (<= .cse45 127) (<= .cse46 127) (<= c_ULTIMATE.start_main_~y~7 v_prenex_105) (<= 0 .cse46)))))) .cse4) (and .cse0 .cse1 .cse4 (exists ((v_prenex_74 Int) (v_prenex_73 Int)) (let ((.cse51 (mod v_prenex_74 c_ULTIMATE.start_main_~y~7))) (let ((.cse48 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse51) 256))) (let ((.cse50 (mod v_prenex_73 (+ .cse48 (- 256))))) (let ((.cse49 (mod (+ .cse48 .cse50) 256))) (and (not (= 256 .cse48)) (< 127 .cse48) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse49) (not (= .cse50 0)) (< 127 .cse49) (< v_prenex_74 0) (< v_prenex_73 0) (not (= .cse51 0)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_73) (< .cse48 256)))))))) (and .cse0 .cse1 .cse4 (exists ((v_prenex_77 Int) (v_prenex_76 Int)) (let ((.cse52 (mod (mod v_prenex_77 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse54 (mod v_prenex_76 .cse52))) (let ((.cse53 (mod (+ .cse52 .cse54) 256))) (and (<= .cse52 127) (<= 0 v_prenex_77) (<= c_ULTIMATE.start_main_~y~7 v_prenex_76) (<= c_ULTIMATE.start_gcd_test_~a .cse53) (< .cse52 0) (<= .cse53 127) (< v_prenex_76 0) (not (= .cse54 0)) (not (= 0 .cse52)))))))) (and .cse0 .cse1 .cse4 (exists ((v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse58 (mod v_prenex_98 c_ULTIMATE.start_main_~y~7))) (let ((.cse57 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse58) 256))) (let ((.cse55 (mod v_prenex_97 (+ .cse57 (- 256))))) (let ((.cse56 (mod .cse55 256))) (and (= .cse55 0) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse56) (not (= 256 .cse57)) (< v_prenex_98 0) (<= 256 .cse57) (<= c_ULTIMATE.start_main_~y~7 v_prenex_97) (< 127 .cse56) (not (= .cse58 0)) (< 127 .cse57)))))))) (and .cse0 .cse1 .cse4 (exists ((v_prenex_109 Int) (v_prenex_108 Int)) (let ((.cse60 (mod v_prenex_109 c_ULTIMATE.start_main_~y~7))) (let ((.cse61 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse60) 256))) (let ((.cse59 (mod v_prenex_108 (+ .cse61 (- 256))))) (let ((.cse62 (mod .cse59 256))) (and (= 0 .cse59) (not (= .cse60 0)) (< v_prenex_109 0) (not (= .cse61 256)) (<= c_ULTIMATE.start_gcd_test_~a .cse62) (< .cse61 256) (<= c_ULTIMATE.start_main_~y~7 v_prenex_108) (< 127 .cse61) (<= .cse62 127)))))))) (and .cse0 .cse1 .cse4 (exists ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse64 (mod v_prenex_118 c_ULTIMATE.start_main_~y~7))) (let ((.cse63 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse64) 256))) (let ((.cse65 (mod (mod v_prenex_117 (+ .cse63 (- 256))) 256))) (and (< 127 .cse63) (not (= .cse64 0)) (<= c_ULTIMATE.start_gcd_test_~a .cse65) (<= .cse65 127) (<= 256 .cse63) (<= 0 v_prenex_117) (<= c_ULTIMATE.start_main_~y~7 v_prenex_117) (< v_prenex_118 0) (not (= .cse63 256)))))))) (and .cse0 (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse66 (mod (mod v_prenex_66 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse68 (mod v_prenex_65 .cse66))) (let ((.cse67 (mod (+ (* 255 .cse66) .cse68) 256))) (and (<= 0 .cse66) (<= c_ULTIMATE.start_gcd_test_~a .cse67) (<= .cse67 127) (<= 0 v_prenex_66) (< v_prenex_65 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_65) (not (= .cse66 0)) (<= .cse66 127) (not (= .cse68 0))))))) .cse1 .cse4) (and .cse0 .cse1 (exists ((v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse70 (mod v_prenex_92 c_ULTIMATE.start_main_~y~7))) (let ((.cse71 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse70) 256))) (let ((.cse72 (mod v_prenex_91 (+ .cse71 (- 256))))) (let ((.cse69 (mod (+ (* 255 .cse71) .cse72) 256))) (and (< 127 .cse69) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse69) (not (= .cse70 0)) (<= 256 .cse71) (< v_prenex_92 0) (< 127 .cse71) (not (= .cse72 0)) (< v_prenex_91 0) (<= c_ULTIMATE.start_main_~y~7 v_prenex_91) (not (= .cse71 256)))))))) .cse4) (and .cse0 .cse1 .cse4 (exists ((v_prenex_104 Int) (v_prenex_102 Int)) (let ((.cse74 (mod (mod v_prenex_104 c_ULTIMATE.start_main_~y~7) 256))) (let ((.cse73 (mod (mod v_prenex_102 .cse74) 256))) (and (< 127 .cse73) (<= (+ c_ULTIMATE.start_gcd_test_~a 256) .cse73) (<= 0 .cse74) (<= .cse74 127) (not (= 0 .cse74)) (<= c_ULTIMATE.start_main_~y~7 v_prenex_102) (<= 0 v_prenex_102) (<= 0 v_prenex_104)))))) (and .cse0 (exists ((v_prenex_121 Int) (v_prenex_120 Int)) (let ((.cse77 (mod v_prenex_121 c_ULTIMATE.start_main_~y~7))) (let ((.cse76 (mod (+ (* 255 c_ULTIMATE.start_main_~y~7) .cse77) 256))) (let ((.cse78 (mod v_prenex_120 (+ .cse76 (- 256))))) (let ((.cse75 (mod .cse78 256))) (and (< v_prenex_121 0) (<= c_ULTIMATE.start_gcd_test_~a .cse75) (not (= .cse76 256)) (not (= .cse77 0)) (< 127 .cse76) (<= 256 .cse76) (= 0 .cse78) (<= .cse75 127) (<= c_ULTIMATE.start_main_~y~7 v_prenex_120))))))) .cse1 .cse4))) is different from false [2018-10-03 09:41:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-10-03 09:42:12,354 WARN L178 SmtUtils]: Spent 42.10 s on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-10-03 09:42:58,663 WARN L178 SmtUtils]: Spent 30.84 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 Received shutdown request... [2018-10-03 09:43:25,055 WARN L186 SmtUtils]: Removed 6 from assertion stack [2018-10-03 09:43:25,055 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck. Reason: Timeout or Toolchain cancelled by user [2018-10-03 09:43:25,058 INFO L168 Benchmark]: Toolchain (without parser) took 295852.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 338.3 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. [2018-10-03 09:43:25,060 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:43:25,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.14 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-03 09:43:25,061 INFO L168 Benchmark]: Boogie Preprocessor took 26.25 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-03 09:43:25,062 INFO L168 Benchmark]: RCFGBuilder took 369.93 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-03 09:43:25,063 INFO L168 Benchmark]: CodeCheck took 295407.24 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: 317.1 MB). Peak memory consumption was 317.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:43:25,068 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck) Toolchain cancelled while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.14 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 26.25 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 369.93 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 295407.24 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: 317.1 MB). Peak memory consumption was 317.1 MB. Max. memory is 7.1 GB. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gcd_2.i_4.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-03_09-43-25-081.csv Completed graceful shutdown