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/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 01:56:57,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 01:56:57,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 01:56:57,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 01:56:57,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 01:56:57,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 01:56:57,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 01:56:57,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 01:56:57,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 01:56:57,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 01:56:57,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 01:56:57,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 01:56:57,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 01:56:57,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 01:56:57,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 01:56:58,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 01:56:58,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 01:56:58,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 01:56:58,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 01:56:58,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 01:56:58,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 01:56:58,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 01:56:58,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 01:56:58,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 01:56:58,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 01:56:58,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 01:56:58,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 01:56:58,025 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 01:56:58,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 01:56:58,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 01:56:58,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 01:56:58,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 01:56:58,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 01:56:58,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 01:56:58,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 01:56:58,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 01:56:58,035 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:56:58,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 01:56:58,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 01:56:58,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 01:56:58,068 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 01:56:58,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 01:56:58,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 01:56:58,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 01:56:58,070 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 01:56:58,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 01:56:58,070 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 01:56:58,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 01:56:58,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 01:56:58,072 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 01:56:58,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 01:56:58,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 01:56:58,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 01:56:58,072 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 01:56:58,073 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-01 01:56:58,073 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-01 01:56:58,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 01:56:58,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 01:56:58,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-01 01:56:58,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 01:56:58,075 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 01:56:58,075 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 01:56:58,076 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-01 01:56:58,076 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 01:56:58,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 01:56:58,076 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 01:56:58,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 01:56:58,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 01:56:58,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 01:56:58,158 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 01:56:58,159 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 01:56:58,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2018-10-01 01:56:58,160 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2018-10-01 01:56:58,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 01:56:58,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 01:56:58,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 01:56:58,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 01:56:58,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 01:56:58,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 01:56:58,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 01:56:58,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 01:56:58,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 01:56:58,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 01:56:58,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 01:56:58,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 01:56:58,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 01:56:58,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 01:56:58" (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:56:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 01:56:58,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 01:56:58,643 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 01:56:58,644 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:56:58 BoogieIcfgContainer [2018-10-01 01:56:58,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 01:56:58,644 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-01 01:56:58,645 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-01 01:56:58,657 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-01 01:56:58,657 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 01:56:58" (1/1) ... [2018-10-01 01:56:58,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 01:56:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:56:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-01 01:56:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-01 01:56:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 01:56:58,724 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:56:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:56:58,917 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:56:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:56:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 01:56:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 01:56:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 01:56:59,147 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:56:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:56:59,216 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-01 01:56:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:56:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 01:56:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 01:56:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 01:56:59,439 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:56:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:56:59,552 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:56:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:56:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 01:56:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 01:56:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 01:56:59,973 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:56:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:00,074 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-01 01:57:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 01:57:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 01:57:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 01:57:00,383 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:00,494 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-01 01:57:00,926 WARN L178 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-01 01:57:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 01:57:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 01:57:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 01:57:01,019 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:01,430 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-01 01:57:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 01:57:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 01:57:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 01:57:01,646 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:01,816 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-01 01:57:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 01:57:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 01:57:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 01:57:02,390 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:02,573 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-01 01:57:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 01:57:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 01:57:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 01:57:02,856 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:03,076 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-01 01:57:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 01:57:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 01:57:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 01:57:03,385 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:03,617 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-01 01:57:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 01:57:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 01:57:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 01:57:03,899 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 01:57:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 01:57:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 01:57:04,362 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:04,953 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-01 01:57:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 01:57:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 01:57:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 01:57:04,972 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 01:57:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 01:57:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 01:57:05,524 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 01:57:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 01:57:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 01:57:06,160 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 01:57:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 01:57:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 01:57:06,929 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 01:57:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 01:57:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 01:57:08,207 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 01:57:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 01:57:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 01:57:09,041 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 01:57:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 01:57:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 01:57:10,136 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:10,967 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-01 01:57:11,266 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-10-01 01:57:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 01:57:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 01:57:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 01:57:11,292 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:12,383 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-01 01:57:12,750 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-01 01:57:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 01:57:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 01:57:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 01:57:12,775 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:14,631 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-10-01 01:57:14,956 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-01 01:57:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 01:57:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 01:57:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 01:57:14,984 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:15,925 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-10-01 01:57:16,276 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-01 01:57:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 01:57:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 01:57:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 01:57:16,300 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:17,476 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-10-01 01:57:17,911 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-01 01:57:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 01:57:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 01:57:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 01:57:17,938 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:18,611 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-10-01 01:57:19,077 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-10-01 01:57:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 01:57:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 01:57:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 01:57:19,103 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:19,966 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-01 01:57:20,370 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-10-01 01:57:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 01:57:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 01:57:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 01:57:20,394 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:21,850 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-10-01 01:57:22,285 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-10-01 01:57:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 01:57:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 01:57:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 01:57:22,313 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:23,444 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-10-01 01:57:23,970 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-10-01 01:57:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-01 01:57:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-01 01:57:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 01:57:24,000 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:24,845 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-10-01 01:57:25,344 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-10-01 01:57:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 01:57:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 01:57:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 01:57:25,370 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:26,280 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-10-01 01:57:26,815 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-10-01 01:57:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-01 01:57:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-01 01:57:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 01:57:26,842 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:27,567 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-10-01 01:57:28,179 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-10-01 01:57:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 01:57:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 01:57:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 01:57:28,213 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:28,997 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2018-10-01 01:57:29,574 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-10-01 01:57:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 01:57:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 01:57:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 01:57:29,606 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:30,982 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2018-10-01 01:57:31,807 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-10-01 01:57:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 01:57:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 01:57:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 01:57:31,839 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:32,955 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2018-10-01 01:57:33,635 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-10-01 01:57:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 01:57:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 01:57:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 01:57:33,665 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:34,509 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-10-01 01:57:35,182 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-10-01 01:57:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 01:57:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 01:57:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 01:57:35,210 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:36,118 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-10-01 01:57:36,784 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-10-01 01:57:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-01 01:57:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-01 01:57:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 01:57:36,887 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:37,914 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2018-10-01 01:57:38,742 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-10-01 01:57:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 01:57:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 01:57:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 01:57:38,771 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:39,755 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-01 01:57:40,511 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-10-01 01:57:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-01 01:57:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-01 01:57:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 01:57:40,541 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:42,068 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2018-10-01 01:57:42,864 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-10-01 01:57:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-01 01:57:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-01 01:57:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 01:57:42,895 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:44,190 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2018-10-01 01:57:45,075 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-10-01 01:57:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-01 01:57:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-01 01:57:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 01:57:45,128 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:46,231 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2018-10-01 01:57:47,066 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2018-10-01 01:57:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-01 01:57:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-01 01:57:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 01:57:47,096 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:48,198 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2018-10-01 01:57:49,148 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2018-10-01 01:57:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-01 01:57:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-01 01:57:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 01:57:49,181 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:50,557 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-10-01 01:57:51,543 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 213 [2018-10-01 01:57:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-01 01:57:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-01 01:57:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-01 01:57:51,573 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:52,758 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2018-10-01 01:57:53,787 WARN L178 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2018-10-01 01:57:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-01 01:57:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-01 01:57:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 01:57:53,819 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:55,079 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2018-10-01 01:57:56,079 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2018-10-01 01:57:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-01 01:57:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-01 01:57:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-01 01:57:56,113 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:57:57,415 WARN L178 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2018-10-01 01:57:58,459 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 228 [2018-10-01 01:57:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:57:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-01 01:57:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-01 01:57:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-01 01:57:58,494 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:57:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:57:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:00,114 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2018-10-01 01:58:01,201 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2018-10-01 01:58:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-01 01:58:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-01 01:58:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 01:58:01,236 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:02,515 WARN L178 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 237 [2018-10-01 01:58:03,650 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2018-10-01 01:58:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-01 01:58:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-01 01:58:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 01:58:03,685 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:08,469 WARN L178 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2018-10-01 01:58:09,672 WARN L178 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 243 [2018-10-01 01:58:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-01 01:58:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-01 01:58:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 01:58:09,707 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:11,134 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2018-10-01 01:58:12,310 WARN L178 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2018-10-01 01:58:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-01 01:58:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-01 01:58:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 01:58:12,347 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:13,779 WARN L178 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2018-10-01 01:58:15,036 WARN L178 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 253 [2018-10-01 01:58:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-01 01:58:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-01 01:58:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 01:58:15,070 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:16,498 WARN L178 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2018-10-01 01:58:17,787 WARN L178 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2018-10-01 01:58:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-01 01:58:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-01 01:58:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-01 01:58:17,822 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:19,433 WARN L178 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2018-10-01 01:58:20,824 WARN L178 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2018-10-01 01:58:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-01 01:58:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-01 01:58:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 01:58:20,858 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:22,418 WARN L178 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2018-10-01 01:58:23,815 WARN L178 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2018-10-01 01:58:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-01 01:58:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-01 01:58:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-01 01:58:23,850 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:25,724 WARN L178 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2018-10-01 01:58:27,141 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2018-10-01 01:58:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-01 01:58:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-01 01:58:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-01 01:58:27,179 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:28,774 WARN L178 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 277 [2018-10-01 01:58:30,292 WARN L178 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2018-10-01 01:58:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-01 01:58:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-01 01:58:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-01 01:58:30,327 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:32,072 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2018-10-01 01:58:33,580 WARN L178 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2018-10-01 01:58:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-01 01:58:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-01 01:58:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 01:58:33,618 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:35,512 WARN L178 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 287 [2018-10-01 01:58:37,036 WARN L178 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 288 [2018-10-01 01:58:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-01 01:58:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-01 01:58:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-01 01:58:37,076 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:38,994 WARN L178 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 292 [2018-10-01 01:58:40,649 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 293 [2018-10-01 01:58:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-01 01:58:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-01 01:58:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-01 01:58:40,685 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:43,215 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 297 [2018-10-01 01:58:44,945 WARN L178 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2018-10-01 01:58:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-01 01:58:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-01 01:58:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-01 01:58:44,984 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:46,838 WARN L178 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-10-01 01:58:48,520 WARN L178 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 303 [2018-10-01 01:58:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-01 01:58:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-01 01:58:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-01 01:58:48,559 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:50,572 WARN L178 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2018-10-01 01:58:52,297 WARN L178 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 308 [2018-10-01 01:58:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-01 01:58:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-01 01:58:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-01 01:58:52,339 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:54,251 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 312 [2018-10-01 01:58:56,103 WARN L178 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 313 [2018-10-01 01:58:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:58:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-01 01:58:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-01 01:58:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-01 01:58:56,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:58:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:58:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:58:58,140 WARN L178 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 317 [2018-10-01 01:58:59,968 WARN L178 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 318 [2018-10-01 01:59:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-01 01:59:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-01 01:59:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-01 01:59:00,008 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:02,204 WARN L178 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 322 [2018-10-01 01:59:04,096 WARN L178 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 323 [2018-10-01 01:59:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-01 01:59:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-01 01:59:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-01 01:59:04,139 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:06,549 WARN L178 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 327 [2018-10-01 01:59:08,501 WARN L178 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 328 [2018-10-01 01:59:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-01 01:59:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-01 01:59:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-01 01:59:08,546 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:10,826 WARN L178 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 332 [2018-10-01 01:59:12,810 WARN L178 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 333 [2018-10-01 01:59:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-01 01:59:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-01 01:59:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 01:59:12,855 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:15,169 WARN L178 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 337 [2018-10-01 01:59:17,227 WARN L178 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 338 [2018-10-01 01:59:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-01 01:59:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-01 01:59:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-01 01:59:17,269 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:19,672 WARN L178 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 342 [2018-10-01 01:59:21,835 WARN L178 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 343 [2018-10-01 01:59:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-01 01:59:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-01 01:59:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-01 01:59:21,878 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:24,234 WARN L178 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2018-10-01 01:59:26,459 WARN L178 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 348 [2018-10-01 01:59:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-01 01:59:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-01 01:59:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-01 01:59:26,505 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:28,976 WARN L178 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 352 [2018-10-01 01:59:31,230 WARN L178 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 353 [2018-10-01 01:59:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-01 01:59:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-01 01:59:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-01 01:59:31,272 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:33,880 WARN L178 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 357 [2018-10-01 01:59:36,178 WARN L178 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 358 [2018-10-01 01:59:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-01 01:59:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-01 01:59:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-01 01:59:36,219 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:38,679 WARN L178 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 362 [2018-10-01 01:59:40,997 WARN L178 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 363 [2018-10-01 01:59:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-01 01:59:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-01 01:59:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 01:59:41,042 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:43,628 WARN L178 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 367 [2018-10-01 01:59:46,029 WARN L178 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 368 [2018-10-01 01:59:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-01 01:59:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-01 01:59:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-01 01:59:46,077 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:48,887 WARN L178 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 372 [2018-10-01 01:59:51,344 WARN L178 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 373 [2018-10-01 01:59:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-01 01:59:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-01 01:59:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-01 01:59:51,390 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:54,133 WARN L178 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 377 [2018-10-01 01:59:56,648 WARN L178 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 378 [2018-10-01 01:59:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 01:59:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-01 01:59:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-01 01:59:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-01 01:59:56,697 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 01:59:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:59:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:59:59,481 WARN L178 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 382 [2018-10-01 02:00:02,101 WARN L178 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 383 [2018-10-01 02:00:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-01 02:00:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-01 02:00:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-01 02:00:02,159 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:05,056 WARN L178 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 387 [2018-10-01 02:00:07,715 WARN L178 SmtUtils]: Spent 684.00 ms on a formula simplification that was a NOOP. DAG size: 388 [2018-10-01 02:00:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-01 02:00:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-01 02:00:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-01 02:00:07,762 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:10,830 WARN L178 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 392 [2018-10-01 02:00:13,557 WARN L178 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 393 [2018-10-01 02:00:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-01 02:00:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-01 02:00:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-01 02:00:13,606 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:16,534 WARN L178 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 397 [2018-10-01 02:00:19,314 WARN L178 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 398 [2018-10-01 02:00:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-01 02:00:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-01 02:00:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-01 02:00:19,360 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:22,461 WARN L178 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 402 [2018-10-01 02:00:25,297 WARN L178 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 403 [2018-10-01 02:00:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-01 02:00:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-01 02:00:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-01 02:00:25,343 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:28,354 WARN L178 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 407 [2018-10-01 02:00:31,240 WARN L178 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 408 [2018-10-01 02:00:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-01 02:00:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-01 02:00:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-01 02:00:31,289 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:34,638 WARN L178 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 412 [2018-10-01 02:00:37,674 WARN L178 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 413 [2018-10-01 02:00:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-01 02:00:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-01 02:00:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-01 02:00:37,725 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:41,026 WARN L178 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 417 [2018-10-01 02:00:44,038 WARN L178 SmtUtils]: Spent 759.00 ms on a formula simplification that was a NOOP. DAG size: 418 [2018-10-01 02:00:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-01 02:00:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-01 02:00:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-01 02:00:44,089 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:47,465 WARN L178 SmtUtils]: Spent 762.00 ms on a formula simplification that was a NOOP. DAG size: 422 [2018-10-01 02:00:50,539 WARN L178 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 423 [2018-10-01 02:00:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-01 02:00:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-01 02:00:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-01 02:00:50,591 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:00:53,956 WARN L178 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 427 [2018-10-01 02:00:57,070 WARN L178 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 428 [2018-10-01 02:00:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:00:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-01 02:00:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-01 02:00:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-01 02:00:57,126 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:00:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:00:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:00,687 WARN L178 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 432 [2018-10-01 02:01:03,951 WARN L178 SmtUtils]: Spent 869.00 ms on a formula simplification that was a NOOP. DAG size: 433 [2018-10-01 02:01:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-01 02:01:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-01 02:01:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-01 02:01:04,006 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:07,502 WARN L178 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 437 [2018-10-01 02:01:10,742 WARN L178 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 438 [2018-10-01 02:01:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-01 02:01:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-01 02:01:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-01 02:01:10,795 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:14,407 WARN L178 SmtUtils]: Spent 834.00 ms on a formula simplification that was a NOOP. DAG size: 442 [2018-10-01 02:01:17,685 WARN L178 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 443 [2018-10-01 02:01:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-01 02:01:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-01 02:01:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-01 02:01:17,739 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:21,446 WARN L178 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 447 [2018-10-01 02:01:24,823 WARN L178 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 448 [2018-10-01 02:01:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-01 02:01:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-01 02:01:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-01 02:01:24,874 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:28,523 WARN L178 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 452 [2018-10-01 02:01:31,983 WARN L178 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 453 [2018-10-01 02:01:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-01 02:01:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-01 02:01:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-01 02:01:32,036 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:35,898 WARN L178 SmtUtils]: Spent 880.00 ms on a formula simplification that was a NOOP. DAG size: 457 [2018-10-01 02:01:39,473 WARN L178 SmtUtils]: Spent 939.00 ms on a formula simplification that was a NOOP. DAG size: 458 [2018-10-01 02:01:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-01 02:01:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-01 02:01:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-01 02:01:39,526 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:43,449 WARN L178 SmtUtils]: Spent 894.00 ms on a formula simplification that was a NOOP. DAG size: 462 [2018-10-01 02:01:47,045 WARN L178 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 463 [2018-10-01 02:01:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-01 02:01:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-01 02:01:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-01 02:01:47,096 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:50,993 WARN L178 SmtUtils]: Spent 910.00 ms on a formula simplification that was a NOOP. DAG size: 467 [2018-10-01 02:01:54,698 WARN L178 SmtUtils]: Spent 956.00 ms on a formula simplification that was a NOOP. DAG size: 468 [2018-10-01 02:01:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:01:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-01 02:01:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-01 02:01:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-01 02:01:54,754 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:01:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:01:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:01:58,685 WARN L178 SmtUtils]: Spent 932.00 ms on a formula simplification that was a NOOP. DAG size: 472 [2018-10-01 02:02:02,444 WARN L178 SmtUtils]: Spent 922.00 ms on a formula simplification that was a NOOP. DAG size: 473 [2018-10-01 02:02:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:02:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-01 02:02:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-01 02:02:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-01 02:02:02,502 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:02:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:02:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:02:06,616 WARN L178 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 477 [2018-10-01 02:02:10,513 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 478 [2018-10-01 02:02:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:02:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-01 02:02:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-01 02:02:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-01 02:02:10,568 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:02:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:02:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:02:14,785 WARN L178 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 482 [2018-10-01 02:02:18,655 WARN L178 SmtUtils]: Spent 954.00 ms on a formula simplification that was a NOOP. DAG size: 483 [2018-10-01 02:02:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:02:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-01 02:02:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-01 02:02:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-01 02:02:18,709 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:02:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:02:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:02:23,182 WARN L178 SmtUtils]: Spent 999.00 ms on a formula simplification that was a NOOP. DAG size: 487 [2018-10-01 02:02:27,116 WARN L178 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 488 [2018-10-01 02:02:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:02:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-01 02:02:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-01 02:02:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-01 02:02:27,172 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:02:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:02:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:02:31,493 WARN L178 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 492 [2018-10-01 02:02:35,490 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 493 [2018-10-01 02:02:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:02:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-01 02:02:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-01 02:02:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-01 02:02:35,546 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:02:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 02:02:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 02:02:39,989 WARN L178 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 497 [2018-10-01 02:02:44,049 WARN L178 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 498 [2018-10-01 02:02:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-01 02:02:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-01 02:02:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-01 02:02:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-01 02:02:44,112 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-10-01 02:02:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 02:02:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 02:02:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 02:02:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-01 02:02:47,619 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-10-01 02:02:47,707 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.10 02:02:47 ImpRootNode [2018-10-01 02:02:47,707 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-01 02:02:47,709 INFO L168 Benchmark]: Toolchain (without parser) took 349478.49 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -272.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 269.6 MB). Peak memory consumption was 297.2 MB. Max. memory is 7.1 GB. [2018-10-01 02:02:47,709 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-01 02:02:47,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.58 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-01 02:02:47,710 INFO L168 Benchmark]: Boogie Preprocessor took 23.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-01 02:02:47,710 INFO L168 Benchmark]: RCFGBuilder took 343.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 02:02:47,711 INFO L168 Benchmark]: CodeCheck took 349063.26 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -272.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 248.5 MB). Peak memory consumption was 276.1 MB. Max. memory is 7.1 GB. [2018-10-01 02:02:47,714 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 348.9s OverallTime, 100 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -4 SDslu, -8 SDs, 0 SdLazy, -10 SolverSat, -6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 154.5s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 55.6s InterpolantComputationTime, 10300 NumberOfCodeBlocks, 10300 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 9999 ConstructedInterpolants, 0 QuantifiedInterpolants, 9273099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/323400 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: 38]: assertion can be violated assertion can be violated We found a FailurePath: [L11] havoc main_#res; [L12] havoc main_#t~nondet0, main_#t~post1, main_~x~5, main_~y~5; [L13] main_~x~5 := 0; [L14] main_~y~5 := main_#t~nondet0; [L15] havoc main_#t~nondet0; VAL [main_~x~5=0] [L18] assume true; VAL [main_~x~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=1, main_~y~5=0] [L18] assume true; VAL [main_~x~5=1, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=2, main_~y~5=0] [L18] assume true; VAL [main_~x~5=2, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=3, main_~y~5=0] [L18] assume true; VAL [main_~x~5=3, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=4, main_~y~5=0] [L18] assume true; VAL [main_~x~5=4, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=5, main_~y~5=0] [L18] assume true; VAL [main_~x~5=5, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=6, main_~y~5=0] [L18] assume true; VAL [main_~x~5=6, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=7, main_~y~5=0] [L18] assume true; VAL [main_~x~5=7, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=8, main_~y~5=0] [L18] assume true; VAL [main_~x~5=8, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=9, main_~y~5=0] [L18] assume true; VAL [main_~x~5=9, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=10, main_~y~5=0] [L18] assume true; VAL [main_~x~5=10, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=11, main_~y~5=0] [L18] assume true; VAL [main_~x~5=11, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=12, main_~y~5=0] [L18] assume true; VAL [main_~x~5=12, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=13, main_~y~5=0] [L18] assume true; VAL [main_~x~5=13, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=14, main_~y~5=0] [L18] assume true; VAL [main_~x~5=14, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=15, main_~y~5=0] [L18] assume true; VAL [main_~x~5=15, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=16, main_~y~5=0] [L18] assume true; VAL [main_~x~5=16, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=17, main_~y~5=0] [L18] assume true; VAL [main_~x~5=17, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=18, main_~y~5=0] [L18] assume true; VAL [main_~x~5=18, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=19, main_~y~5=0] [L18] assume true; VAL [main_~x~5=19, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=20, main_~y~5=0] [L18] assume true; VAL [main_~x~5=20, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=21, main_~y~5=0] [L18] assume true; VAL [main_~x~5=21, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=22, main_~y~5=0] [L18] assume true; VAL [main_~x~5=22, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=23, main_~y~5=0] [L18] assume true; VAL [main_~x~5=23, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=24, main_~y~5=0] [L18] assume true; VAL [main_~x~5=24, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=25, main_~y~5=0] [L18] assume true; VAL [main_~x~5=25, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=26, main_~y~5=0] [L18] assume true; VAL [main_~x~5=26, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=27, main_~y~5=0] [L18] assume true; VAL [main_~x~5=27, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=28, main_~y~5=0] [L18] assume true; VAL [main_~x~5=28, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=29, main_~y~5=0] [L18] assume true; VAL [main_~x~5=29, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=30, main_~y~5=0] [L18] assume true; VAL [main_~x~5=30, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=31, main_~y~5=0] [L18] assume true; VAL [main_~x~5=31, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=32, main_~y~5=0] [L18] assume true; VAL [main_~x~5=32, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=33, main_~y~5=0] [L18] assume true; VAL [main_~x~5=33, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=34, main_~y~5=0] [L18] assume true; VAL [main_~x~5=34, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=35, main_~y~5=0] [L18] assume true; VAL [main_~x~5=35, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=36, main_~y~5=0] [L18] assume true; VAL [main_~x~5=36, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=37, main_~y~5=0] [L18] assume true; VAL [main_~x~5=37, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=38, main_~y~5=0] [L18] assume true; VAL [main_~x~5=38, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=39, main_~y~5=0] [L18] assume true; VAL [main_~x~5=39, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=40, main_~y~5=0] [L18] assume true; VAL [main_~x~5=40, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=41, main_~y~5=0] [L18] assume true; VAL [main_~x~5=41, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=42, main_~y~5=0] [L18] assume true; VAL [main_~x~5=42, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=43, main_~y~5=0] [L18] assume true; VAL [main_~x~5=43, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=44, main_~y~5=0] [L18] assume true; VAL [main_~x~5=44, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=45, main_~y~5=0] [L18] assume true; VAL [main_~x~5=45, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=46, main_~y~5=0] [L18] assume true; VAL [main_~x~5=46, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=47, main_~y~5=0] [L18] assume true; VAL [main_~x~5=47, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=48, main_~y~5=0] [L18] assume true; VAL [main_~x~5=48, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=49, main_~y~5=0] [L18] assume true; VAL [main_~x~5=49, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=50, main_~y~5=0] [L18] assume true; VAL [main_~x~5=50, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=51, main_~y~5=0] [L18] assume true; VAL [main_~x~5=51, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=52, main_~y~5=0] [L18] assume true; VAL [main_~x~5=52, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=53, main_~y~5=0] [L18] assume true; VAL [main_~x~5=53, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=54, main_~y~5=0] [L18] assume true; VAL [main_~x~5=54, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=55, main_~y~5=0] [L18] assume true; VAL [main_~x~5=55, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=56, main_~y~5=0] [L18] assume true; VAL [main_~x~5=56, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=57, main_~y~5=0] [L18] assume true; VAL [main_~x~5=57, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=58, main_~y~5=0] [L18] assume true; VAL [main_~x~5=58, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=59, main_~y~5=0] [L18] assume true; VAL [main_~x~5=59, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=60, main_~y~5=0] [L18] assume true; VAL [main_~x~5=60, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=61, main_~y~5=0] [L18] assume true; VAL [main_~x~5=61, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=62, main_~y~5=0] [L18] assume true; VAL [main_~x~5=62, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=63, main_~y~5=0] [L18] assume true; VAL [main_~x~5=63, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=64, main_~y~5=0] [L18] assume true; VAL [main_~x~5=64, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=65, main_~y~5=0] [L18] assume true; VAL [main_~x~5=65, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=66, main_~y~5=0] [L18] assume true; VAL [main_~x~5=66, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=67, main_~y~5=0] [L18] assume true; VAL [main_~x~5=67, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=68, main_~y~5=0] [L18] assume true; VAL [main_~x~5=68, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=69, main_~y~5=0] [L18] assume true; VAL [main_~x~5=69, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=70, main_~y~5=0] [L18] assume true; VAL [main_~x~5=70, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=71, main_~y~5=0] [L18] assume true; VAL [main_~x~5=71, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=72, main_~y~5=0] [L18] assume true; VAL [main_~x~5=72, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=73, main_~y~5=0] [L18] assume true; VAL [main_~x~5=73, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=74, main_~y~5=0] [L18] assume true; VAL [main_~x~5=74, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=75, main_~y~5=0] [L18] assume true; VAL [main_~x~5=75, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=76, main_~y~5=0] [L18] assume true; VAL [main_~x~5=76, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=77, main_~y~5=0] [L18] assume true; VAL [main_~x~5=77, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=78, main_~y~5=0] [L18] assume true; VAL [main_~x~5=78, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=79, main_~y~5=0] [L18] assume true; VAL [main_~x~5=79, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=80, main_~y~5=0] [L18] assume true; VAL [main_~x~5=80, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=81, main_~y~5=0] [L18] assume true; VAL [main_~x~5=81, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=82, main_~y~5=0] [L18] assume true; VAL [main_~x~5=82, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=83, main_~y~5=0] [L18] assume true; VAL [main_~x~5=83, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=84, main_~y~5=0] [L18] assume true; VAL [main_~x~5=84, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=85, main_~y~5=0] [L18] assume true; VAL [main_~x~5=85, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=86, main_~y~5=0] [L18] assume true; VAL [main_~x~5=86, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=87, main_~y~5=0] [L18] assume true; VAL [main_~x~5=87, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=88, main_~y~5=0] [L18] assume true; VAL [main_~x~5=88, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=89, main_~y~5=0] [L18] assume true; VAL [main_~x~5=89, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=90, main_~y~5=0] [L18] assume true; VAL [main_~x~5=90, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=91, main_~y~5=0] [L18] assume true; VAL [main_~x~5=91, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=92, main_~y~5=0] [L18] assume true; VAL [main_~x~5=92, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=93, main_~y~5=0] [L18] assume true; VAL [main_~x~5=93, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=94, main_~y~5=0] [L18] assume true; VAL [main_~x~5=94, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=95, main_~y~5=0] [L18] assume true; VAL [main_~x~5=95, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=96, main_~y~5=0] [L18] assume true; VAL [main_~x~5=96, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=97, main_~y~5=0] [L18] assume true; VAL [main_~x~5=97, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=98, main_~y~5=0] [L18] assume true; VAL [main_~x~5=98, main_~y~5=0] [L31] assume !!(main_~x~5 % 4294967296 < 99); [L32] assume (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 == 0; [L33] main_#t~post1 := main_~x~5; [L34] main_~x~5 := main_#t~post1 + 1; [L35] havoc main_#t~post1; VAL [main_~x~5=99, main_~y~5=0] [L18] assume true; VAL [main_~x~5=99, main_~y~5=0] [L23] assume !(main_~x~5 % 4294967296 < 99); [L24] __VERIFIER_assert_#in~cond := (if (if main_~x~5 % 4294967296 < 0 && main_~x~5 % 4294967296 % 2 != 0 then main_~x~5 % 4294967296 % 2 - 2 else main_~x~5 % 4294967296 % 2) % 4294967296 == (if main_~y~5 % 4294967296 < 0 && main_~y~5 % 4294967296 % 2 != 0 then main_~y~5 % 4294967296 % 2 - 2 else main_~y~5 % 4294967296 % 2) % 4294967296 then 1 else 0); [L25] havoc __VERIFIER_assert_~cond; [L26] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L27] assume __VERIFIER_assert_~cond == 0; [L28] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~5=99, main_~y~5=0] [L38] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~5=99, main_~y~5=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 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 42.58 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.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. * RCFGBuilder took 343.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 349063.26 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -272.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 248.5 MB). Peak memory consumption was 276.1 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/diamond1.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-01_02-02-47-726.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond1.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-01_02-02-47-726.csv Received shutdown request...