java -ea -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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:39:14,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:39:14,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:39:14,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:39:14,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:39:14,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:39:14,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:39:14,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:39:14,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:39:14,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:39:14,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:39:14,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:39:14,191 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:39:14,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:39:14,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:39:14,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:39:14,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:39:14,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:39:14,211 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:39:14,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:39:14,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:39:14,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:39:14,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:39:14,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:39:14,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:39:14,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:39:14,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:39:14,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:39:14,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:39:14,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:39:14,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:39:14,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:39:14,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:39:14,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:39:14,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:39:14,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:39:14,237 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:39:14,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:39:14,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:39:14,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:39:14,265 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:39:14,266 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:39:14,266 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:39:14,266 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:39:14,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:39:14,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:39:14,268 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:39:14,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:39:14,268 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:39:14,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:39:14,268 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:39:14,269 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:39:14,269 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:39:14,269 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:39:14,269 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:39:14,269 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:39:14,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:39:14,270 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:39:14,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:39:14,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:39:14,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:39:14,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:39:14,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:39:14,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:39:14,271 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:39:14,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:39:14,273 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:39:14,273 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:39:14,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:39:14,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:39:14,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:39:14,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:39:14,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:39:14,358 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:39:14,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-14 16:39:14,418 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8c84c91/ab081a23aff14ecf990392e7fb04d810/FLAG2d5f45866 [2018-11-14 16:39:14,891 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:39:14,892 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-14 16:39:14,899 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8c84c91/ab081a23aff14ecf990392e7fb04d810/FLAG2d5f45866 [2018-11-14 16:39:14,911 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8c84c91/ab081a23aff14ecf990392e7fb04d810 [2018-11-14 16:39:14,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:39:14,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:39:14,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:14,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:39:14,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:39:14,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:14" (1/1) ... [2018-11-14 16:39:14,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ab44d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:14, skipping insertion in model container [2018-11-14 16:39:14,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:39:14" (1/1) ... [2018-11-14 16:39:14,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:39:14,964 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:39:15,231 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:15,239 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:39:15,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:39:15,283 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:39:15,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15 WrapperNode [2018-11-14 16:39:15,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:39:15,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:39:15,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:39:15,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:39:15,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (1/1) ... [2018-11-14 16:39:15,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:39:15,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:39:15,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:39:15,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:39:15,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (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:2000 (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:2000 [2018-11-14 16:39:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:39:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:39:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:39:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:39:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:39:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 16:39:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:39:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:39:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:39:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:39:15,902 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:39:15,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:15 BoogieIcfgContainer [2018-11-14 16:39:15,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:39:15,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:39:15,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:39:15,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:39:15,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:39:14" (1/3) ... [2018-11-14 16:39:15,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34addb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:15, skipping insertion in model container [2018-11-14 16:39:15,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:39:15" (2/3) ... [2018-11-14 16:39:15,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34addb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:39:15, skipping insertion in model container [2018-11-14 16:39:15,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:39:15" (3/3) ... [2018-11-14 16:39:15,911 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call1.i [2018-11-14 16:39:15,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:39:15,928 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:39:15,946 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:39:15,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:39:15,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:39:15,981 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:39:15,981 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:39:15,981 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:39:15,981 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:39:15,982 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:39:15,982 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:39:15,982 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:39:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-14 16:39:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 16:39:16,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:16,007 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:16,009 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:16,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-14 16:39:16,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:16,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:16,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:16,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:16,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-14 16:39:16,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-14 16:39:16,213 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-14 16:39:16,213 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-14 16:39:16,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {22#true} is VALID [2018-11-14 16:39:16,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-14 16:39:16,225 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-14 16:39:16,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-14 16:39:16,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~cond == 0bv32; {23#false} is VALID [2018-11-14 16:39:16,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-14 16:39:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:16,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:16,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:16,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:39:16,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:39:16,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:16,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:39:16,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:16,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:39:16,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:39:16,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:16,303 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-14 16:39:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:16,378 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 16:39:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:39:16,379 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:39:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 16:39:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 16:39:16,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-14 16:39:16,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:16,697 INFO L225 Difference]: With dead ends: 30 [2018-11-14 16:39:16,697 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 16:39:16,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 16:39:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 16:39:16,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:16,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 16:39:16,770 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 16:39:16,770 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 16:39:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:16,774 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-14 16:39:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-14 16:39:16,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:16,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:16,775 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 16:39:16,775 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 16:39:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:16,778 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-14 16:39:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-14 16:39:16,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:16,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:16,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:16,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:39:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-14 16:39:16,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-14 16:39:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:16,784 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-14 16:39:16,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:39:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-14 16:39:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:39:16,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:16,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:16,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:16,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-14 16:39:16,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:16,786 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:16,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:16,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-14 16:39:16,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-14 16:39:16,913 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #38#return; {138#true} is VALID [2018-11-14 16:39:16,913 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret2 := main(); {138#true} is VALID [2018-11-14 16:39:16,915 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {155#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:16,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#(= main_~x~0 (_ bv0 32))} assume true; {155#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:16,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {155#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {139#false} is VALID [2018-11-14 16:39:16,920 INFO L256 TraceCheckUtils]: 7: Hoare triple {139#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {139#false} is VALID [2018-11-14 16:39:16,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {139#false} ~cond := #in~cond; {139#false} is VALID [2018-11-14 16:39:16,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {139#false} assume ~cond == 0bv32; {139#false} is VALID [2018-11-14 16:39:16,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-14 16:39:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:16,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:16,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:16,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:16,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:39:16,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:16,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:16,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:16,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:16,963 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-14 16:39:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:17,154 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-14 16:39:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:17,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:39:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-14 16:39:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-14 16:39:17,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2018-11-14 16:39:17,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:17,223 INFO L225 Difference]: With dead ends: 21 [2018-11-14 16:39:17,223 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 16:39:17,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 16:39:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-14 16:39:17,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:17,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-14 16:39:17,239 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-14 16:39:17,239 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-14 16:39:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:17,241 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-14 16:39:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-14 16:39:17,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:17,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:17,243 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-14 16:39:17,243 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-14 16:39:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:17,245 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-14 16:39:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-14 16:39:17,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:17,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:17,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:17,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:39:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-14 16:39:17,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-14 16:39:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:17,248 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-14 16:39:17,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 16:39:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:39:17,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:17,250 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:17,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:17,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-14 16:39:17,251 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:17,251 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:17,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:17,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:17,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2018-11-14 16:39:17,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {259#true} assume true; {259#true} is VALID [2018-11-14 16:39:17,377 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {259#true} {259#true} #38#return; {259#true} is VALID [2018-11-14 16:39:17,377 INFO L256 TraceCheckUtils]: 3: Hoare triple {259#true} call #t~ret2 := main(); {259#true} is VALID [2018-11-14 16:39:17,378 INFO L273 TraceCheckUtils]: 4: Hoare triple {259#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {276#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:17,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {276#(= main_~x~0 (_ bv0 32))} assume true; {276#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:17,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {276#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {276#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:17,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {276#(= main_~x~0 (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {286#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:17,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {286#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:17,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {260#false} is VALID [2018-11-14 16:39:17,383 INFO L256 TraceCheckUtils]: 10: Hoare triple {260#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {260#false} is VALID [2018-11-14 16:39:17,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2018-11-14 16:39:17,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {260#false} assume ~cond == 0bv32; {260#false} is VALID [2018-11-14 16:39:17,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {260#false} assume !false; {260#false} is VALID [2018-11-14 16:39:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:17,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:17,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {260#false} assume !false; {260#false} is VALID [2018-11-14 16:39:17,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {260#false} assume ~cond == 0bv32; {260#false} is VALID [2018-11-14 16:39:17,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2018-11-14 16:39:17,542 INFO L256 TraceCheckUtils]: 10: Hoare triple {260#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {260#false} is VALID [2018-11-14 16:39:17,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {317#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {260#false} is VALID [2018-11-14 16:39:17,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {317#(bvult main_~x~0 (_ bv99 32))} assume true; {317#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:17,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {324#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {317#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:17,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {324#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:17,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume true; {324#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:17,626 INFO L273 TraceCheckUtils]: 4: Hoare triple {259#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {324#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:17,627 INFO L256 TraceCheckUtils]: 3: Hoare triple {259#true} call #t~ret2 := main(); {259#true} is VALID [2018-11-14 16:39:17,627 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {259#true} {259#true} #38#return; {259#true} is VALID [2018-11-14 16:39:17,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {259#true} assume true; {259#true} is VALID [2018-11-14 16:39:17,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2018-11-14 16:39:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:17,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:17,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:39:17,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-14 16:39:17,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:17,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:39:17,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:17,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:39:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:39:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:39:17,864 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2018-11-14 16:39:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:18,230 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-14 16:39:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:39:18,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-14 16:39:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-14 16:39:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-14 16:39:18,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-14 16:39:18,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:18,356 INFO L225 Difference]: With dead ends: 29 [2018-11-14 16:39:18,356 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 16:39:18,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:39:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 16:39:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 16:39:18,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:18,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:18,377 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:18,377 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:18,379 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-14 16:39:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-14 16:39:18,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:18,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:18,384 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:18,384 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 16:39:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:18,388 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-14 16:39:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-14 16:39:18,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:18,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:18,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:18,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:39:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-14 16:39:18,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2018-11-14 16:39:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:18,392 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-14 16:39:18,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:39:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-14 16:39:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:39:18,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:18,393 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:18,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:18,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1242161282, now seen corresponding path program 1 times [2018-11-14 16:39:18,394 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:18,394 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:18,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:18,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:18,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-14 16:39:18,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-14 16:39:18,557 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #38#return; {475#true} is VALID [2018-11-14 16:39:18,558 INFO L256 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret2 := main(); {475#true} is VALID [2018-11-14 16:39:18,561 INFO L273 TraceCheckUtils]: 4: Hoare triple {475#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {492#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:18,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#(= main_~x~0 (_ bv0 32))} assume true; {492#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:18,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {492#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:18,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#(= main_~x~0 (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {502#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:18,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {502#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {502#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:18,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {502#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {502#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:18,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {502#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {512#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:18,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {512#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {512#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:18,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {512#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {476#false} is VALID [2018-11-14 16:39:18,582 INFO L256 TraceCheckUtils]: 13: Hoare triple {476#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {476#false} is VALID [2018-11-14 16:39:18,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#false} ~cond := #in~cond; {476#false} is VALID [2018-11-14 16:39:18,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} assume ~cond == 0bv32; {476#false} is VALID [2018-11-14 16:39:18,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-14 16:39:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:18,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:18,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-14 16:39:18,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} assume ~cond == 0bv32; {476#false} is VALID [2018-11-14 16:39:18,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#false} ~cond := #in~cond; {476#false} is VALID [2018-11-14 16:39:18,724 INFO L256 TraceCheckUtils]: 13: Hoare triple {476#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {476#false} is VALID [2018-11-14 16:39:18,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {543#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {476#false} is VALID [2018-11-14 16:39:18,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {543#(bvult main_~x~0 (_ bv99 32))} assume true; {543#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:18,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {550#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {543#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:18,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {550#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {550#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:18,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {550#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume true; {550#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:18,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {560#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {550#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:18,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {560#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {560#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:18,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {560#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume true; {560#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:18,747 INFO L273 TraceCheckUtils]: 4: Hoare triple {475#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {560#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:18,747 INFO L256 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret2 := main(); {475#true} is VALID [2018-11-14 16:39:18,747 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #38#return; {475#true} is VALID [2018-11-14 16:39:18,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-14 16:39:18,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-14 16:39:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:18,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:18,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:39:18,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-14 16:39:18,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:18,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:39:18,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:18,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:39:18,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:39:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:39:18,857 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 8 states. [2018-11-14 16:39:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:19,367 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-14 16:39:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:39:19,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-14 16:39:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:39:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-14 16:39:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:39:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-14 16:39:19,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2018-11-14 16:39:19,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:19,462 INFO L225 Difference]: With dead ends: 45 [2018-11-14 16:39:19,462 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:39:19,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:39:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:39:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2018-11-14 16:39:19,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:19,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 30 states. [2018-11-14 16:39:19,493 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 30 states. [2018-11-14 16:39:19,493 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 30 states. [2018-11-14 16:39:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:19,497 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 16:39:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 16:39:19,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:19,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:19,498 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 40 states. [2018-11-14 16:39:19,498 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 40 states. [2018-11-14 16:39:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:19,502 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 16:39:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 16:39:19,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:19,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:19,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:19,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:39:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-14 16:39:19,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2018-11-14 16:39:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:19,506 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-14 16:39:19,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:39:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 16:39:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:39:19,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:19,509 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:19,509 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:19,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 427509150, now seen corresponding path program 2 times [2018-11-14 16:39:19,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:19,510 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:19,525 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:19,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:39:19,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:19,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:19,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {775#true} is VALID [2018-11-14 16:39:19,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2018-11-14 16:39:19,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #38#return; {775#true} is VALID [2018-11-14 16:39:19,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {775#true} call #t~ret2 := main(); {775#true} is VALID [2018-11-14 16:39:19,666 INFO L273 TraceCheckUtils]: 4: Hoare triple {775#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {792#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:19,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {792#(= main_~x~0 (_ bv0 32))} assume true; {792#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:19,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {792#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {792#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:19,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {792#(= main_~x~0 (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {802#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:19,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {802#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:19,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {802#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {802#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:19,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {802#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {812#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:19,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(= (_ bv2 32) main_~x~0)} assume true; {812#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:19,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {812#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {812#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:19,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(= (_ bv2 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {822#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:19,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {822#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {822#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:19,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {822#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {822#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:19,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {822#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {832#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:19,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {832#(= (_ bv4 32) main_~x~0)} assume true; {832#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:19,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {832#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 99bv32); {776#false} is VALID [2018-11-14 16:39:19,680 INFO L256 TraceCheckUtils]: 19: Hoare triple {776#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {776#false} is VALID [2018-11-14 16:39:19,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2018-11-14 16:39:19,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {776#false} assume ~cond == 0bv32; {776#false} is VALID [2018-11-14 16:39:19,681 INFO L273 TraceCheckUtils]: 22: Hoare triple {776#false} assume !false; {776#false} is VALID [2018-11-14 16:39:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:19,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:19,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {776#false} assume !false; {776#false} is VALID [2018-11-14 16:39:19,891 INFO L273 TraceCheckUtils]: 21: Hoare triple {776#false} assume ~cond == 0bv32; {776#false} is VALID [2018-11-14 16:39:19,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2018-11-14 16:39:19,892 INFO L256 TraceCheckUtils]: 19: Hoare triple {776#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {776#false} is VALID [2018-11-14 16:39:19,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {776#false} is VALID [2018-11-14 16:39:19,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#(bvult main_~x~0 (_ bv99 32))} assume true; {863#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:19,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {870#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {863#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:19,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {870#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {870#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume true; {870#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {880#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {870#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {880#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {880#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {880#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume true; {880#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {880#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {890#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {890#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {890#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume true; {890#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {900#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {890#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {900#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {900#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume true; {900#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {775#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {900#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:19,956 INFO L256 TraceCheckUtils]: 3: Hoare triple {775#true} call #t~ret2 := main(); {775#true} is VALID [2018-11-14 16:39:19,956 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #38#return; {775#true} is VALID [2018-11-14 16:39:19,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2018-11-14 16:39:19,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {775#true} is VALID [2018-11-14 16:39:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:19,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:39:19,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-14 16:39:19,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:19,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:39:20,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:20,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:39:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:39:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:39:20,051 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 12 states. [2018-11-14 16:39:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:21,221 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-14 16:39:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:39:21,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-14 16:39:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2018-11-14 16:39:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2018-11-14 16:39:21,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2018-11-14 16:39:21,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:21,351 INFO L225 Difference]: With dead ends: 86 [2018-11-14 16:39:21,351 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 16:39:21,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:39:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 16:39:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2018-11-14 16:39:21,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:21,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 42 states. [2018-11-14 16:39:21,412 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 42 states. [2018-11-14 16:39:21,412 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 42 states. [2018-11-14 16:39:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:21,416 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-14 16:39:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-11-14 16:39:21,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:21,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:21,418 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 81 states. [2018-11-14 16:39:21,418 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 81 states. [2018-11-14 16:39:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:21,423 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-14 16:39:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-11-14 16:39:21,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:21,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:21,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:21,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:39:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-11-14 16:39:21,427 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 23 [2018-11-14 16:39:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:21,428 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-14 16:39:21,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:39:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 16:39:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:39:21,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:21,429 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:21,430 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:21,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:21,430 INFO L82 PathProgramCache]: Analyzing trace with hash 534049918, now seen corresponding path program 1 times [2018-11-14 16:39:21,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:21,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:21,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:39:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:21,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:21,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {1273#true} call ULTIMATE.init(); {1273#true} is VALID [2018-11-14 16:39:21,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {1273#true} assume true; {1273#true} is VALID [2018-11-14 16:39:21,532 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1273#true} {1273#true} #38#return; {1273#true} is VALID [2018-11-14 16:39:21,533 INFO L256 TraceCheckUtils]: 3: Hoare triple {1273#true} call #t~ret2 := main(); {1273#true} is VALID [2018-11-14 16:39:21,533 INFO L273 TraceCheckUtils]: 4: Hoare triple {1273#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1273#true} is VALID [2018-11-14 16:39:21,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {1273#true} assume true; {1273#true} is VALID [2018-11-14 16:39:21,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {1273#true} assume !!~bvult32(~x~0, 99bv32); {1273#true} is VALID [2018-11-14 16:39:21,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {1273#true} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1299#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:21,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {1299#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume true; {1299#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:21,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {1299#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {1299#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:21,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {1299#(= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1274#false} is VALID [2018-11-14 16:39:21,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 16:39:21,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {1274#false} assume !!~bvult32(~x~0, 99bv32); {1274#false} is VALID [2018-11-14 16:39:21,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {1274#false} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1274#false} is VALID [2018-11-14 16:39:21,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 16:39:21,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {1274#false} assume !!~bvult32(~x~0, 99bv32); {1274#false} is VALID [2018-11-14 16:39:21,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {1274#false} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1274#false} is VALID [2018-11-14 16:39:21,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 16:39:21,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1274#false} assume !!~bvult32(~x~0, 99bv32); {1274#false} is VALID [2018-11-14 16:39:21,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {1274#false} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1274#false} is VALID [2018-11-14 16:39:21,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 16:39:21,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {1274#false} assume !!~bvult32(~x~0, 99bv32); {1274#false} is VALID [2018-11-14 16:39:21,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {1274#false} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1274#false} is VALID [2018-11-14 16:39:21,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 16:39:21,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {1274#false} assume !~bvult32(~x~0, 99bv32); {1274#false} is VALID [2018-11-14 16:39:21,540 INFO L256 TraceCheckUtils]: 25: Hoare triple {1274#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1274#false} is VALID [2018-11-14 16:39:21,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {1274#false} ~cond := #in~cond; {1274#false} is VALID [2018-11-14 16:39:21,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {1274#false} assume ~cond == 0bv32; {1274#false} is VALID [2018-11-14 16:39:21,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {1274#false} assume !false; {1274#false} is VALID [2018-11-14 16:39:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 16:39:21,543 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:21,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:21,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:21,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:39:21,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:21,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:21,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:21,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:21,582 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2018-11-14 16:39:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:21,699 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2018-11-14 16:39:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:21,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:39:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-11-14 16:39:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-11-14 16:39:21,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2018-11-14 16:39:21,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:21,813 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:39:21,814 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:39:21,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:39:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-14 16:39:21,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:21,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-14 16:39:21,958 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-14 16:39:21,959 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-14 16:39:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:21,962 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-14 16:39:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-14 16:39:21,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:21,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:21,963 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-14 16:39:21,963 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-14 16:39:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:21,967 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-14 16:39:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-14 16:39:21,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:21,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:21,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:21,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:39:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-14 16:39:21,971 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2018-11-14 16:39:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:21,972 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-14 16:39:21,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-14 16:39:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:39:21,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:21,973 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:21,973 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:21,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1608908740, now seen corresponding path program 2 times [2018-11-14 16:39:21,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:21,974 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:22,004 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:22,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:39:22,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:22,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:22,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {1686#true} call ULTIMATE.init(); {1686#true} is VALID [2018-11-14 16:39:22,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {1686#true} assume true; {1686#true} is VALID [2018-11-14 16:39:22,133 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1686#true} {1686#true} #38#return; {1686#true} is VALID [2018-11-14 16:39:22,134 INFO L256 TraceCheckUtils]: 3: Hoare triple {1686#true} call #t~ret2 := main(); {1686#true} is VALID [2018-11-14 16:39:22,134 INFO L273 TraceCheckUtils]: 4: Hoare triple {1686#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {1686#true} is VALID [2018-11-14 16:39:22,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {1686#true} assume true; {1686#true} is VALID [2018-11-14 16:39:22,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {1686#true} assume !!~bvult32(~x~0, 99bv32); {1686#true} is VALID [2018-11-14 16:39:22,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {1686#true} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume true; {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume true; {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume true; {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume true; {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume true; {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume !!~bvult32(~x~0, 99bv32); {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} is VALID [2018-11-14 16:39:22,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {1712#(not (= (bvurem main_~y~0 (_ bv2 32)) (_ bv0 32)))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1687#false} is VALID [2018-11-14 16:39:22,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#false} assume true; {1687#false} is VALID [2018-11-14 16:39:22,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#false} assume !~bvult32(~x~0, 99bv32); {1687#false} is VALID [2018-11-14 16:39:22,197 INFO L256 TraceCheckUtils]: 25: Hoare triple {1687#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {1687#false} is VALID [2018-11-14 16:39:22,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {1687#false} ~cond := #in~cond; {1687#false} is VALID [2018-11-14 16:39:22,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {1687#false} assume ~cond == 0bv32; {1687#false} is VALID [2018-11-14 16:39:22,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2018-11-14 16:39:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:39:22,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:22,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:22,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:22,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:39:22,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:22,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:22,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:22,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:22,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:22,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:22,228 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 3 states. [2018-11-14 16:39:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:22,323 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-11-14 16:39:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:22,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:39:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-14 16:39:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-14 16:39:22,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2018-11-14 16:39:22,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:22,388 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:39:22,388 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:39:22,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:39:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-14 16:39:22,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:22,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-14 16:39:22,483 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-14 16:39:22,483 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-14 16:39:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:22,486 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-14 16:39:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 16:39:22,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:22,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:22,487 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-14 16:39:22,487 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-14 16:39:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:22,490 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-14 16:39:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 16:39:22,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:22,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:22,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:22,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:39:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-14 16:39:22,494 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 29 [2018-11-14 16:39:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:22,494 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-14 16:39:22,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 16:39:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:39:22,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:22,495 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:22,496 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:22,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 166098622, now seen corresponding path program 2 times [2018-11-14 16:39:22,496 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:22,496 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:22,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:39:22,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:22,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:22,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-14 16:39:22,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 16:39:22,770 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2099#true} {2099#true} #38#return; {2099#true} is VALID [2018-11-14 16:39:22,770 INFO L256 TraceCheckUtils]: 3: Hoare triple {2099#true} call #t~ret2 := main(); {2099#true} is VALID [2018-11-14 16:39:22,787 INFO L273 TraceCheckUtils]: 4: Hoare triple {2099#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2116#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:22,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {2116#(= main_~x~0 (_ bv0 32))} assume true; {2116#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:22,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {2116#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2116#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:22,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {2116#(= main_~x~0 (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2126#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {2126#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2126#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {2126#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2126#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {2126#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2136#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {2136#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2136#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {2136#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2136#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {2136#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2146#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:22,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {2146#(= (_ bv6 32) main_~x~0)} assume true; {2146#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:22,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {2146#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2146#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:22,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {2146#(= (_ bv6 32) main_~x~0)} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2156#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {2156#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2156#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {2156#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2156#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {2156#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2166#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {2166#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2166#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {2166#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2166#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {2166#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2176#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {2176#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {2176#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:22,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {2176#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {2100#false} is VALID [2018-11-14 16:39:22,826 INFO L256 TraceCheckUtils]: 25: Hoare triple {2100#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2100#false} is VALID [2018-11-14 16:39:22,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-14 16:39:22,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {2100#false} assume ~cond == 0bv32; {2100#false} is VALID [2018-11-14 16:39:22,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-14 16:39:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:22,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:23,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {2100#false} assume !false; {2100#false} is VALID [2018-11-14 16:39:23,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {2100#false} assume ~cond == 0bv32; {2100#false} is VALID [2018-11-14 16:39:23,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {2100#false} ~cond := #in~cond; {2100#false} is VALID [2018-11-14 16:39:23,109 INFO L256 TraceCheckUtils]: 25: Hoare triple {2100#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2100#false} is VALID [2018-11-14 16:39:23,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {2100#false} is VALID [2018-11-14 16:39:23,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {2207#(bvult main_~x~0 (_ bv99 32))} assume true; {2207#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:23,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {2214#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2207#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:23,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {2214#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {2214#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {2214#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume true; {2214#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {2224#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2214#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {2224#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {2224#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {2224#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume true; {2224#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {2234#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2224#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {2234#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {2234#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {2234#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume true; {2234#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {2244#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2234#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {2244#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {2244#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {2244#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume true; {2244#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {2254#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2244#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {2254#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {2254#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {2254#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume true; {2254#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {2264#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {2254#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {2264#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {2264#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {2264#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume true; {2264#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,145 INFO L273 TraceCheckUtils]: 4: Hoare triple {2099#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2264#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:23,146 INFO L256 TraceCheckUtils]: 3: Hoare triple {2099#true} call #t~ret2 := main(); {2099#true} is VALID [2018-11-14 16:39:23,146 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2099#true} {2099#true} #38#return; {2099#true} is VALID [2018-11-14 16:39:23,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {2099#true} assume true; {2099#true} is VALID [2018-11-14 16:39:23,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {2099#true} call ULTIMATE.init(); {2099#true} is VALID [2018-11-14 16:39:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:23,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:23,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 16:39:23,152 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-14 16:39:23,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:23,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:39:23,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:23,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:39:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:39:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:39:23,244 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 16 states. [2018-11-14 16:39:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:24,815 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-11-14 16:39:24,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:39:24,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-14 16:39:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:39:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2018-11-14 16:39:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:39:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2018-11-14 16:39:24,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2018-11-14 16:39:25,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:25,107 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:39:25,107 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 16:39:25,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:39:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 16:39:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-14 16:39:25,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:25,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-14 16:39:25,293 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-14 16:39:25,293 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-14 16:39:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:25,297 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-14 16:39:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 16:39:25,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:25,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:25,298 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-14 16:39:25,298 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-14 16:39:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:25,301 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-14 16:39:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 16:39:25,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:25,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:25,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:25,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 16:39:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-14 16:39:25,306 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 29 [2018-11-14 16:39:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:25,306 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-14 16:39:25,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:39:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 16:39:25,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:39:25,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:25,308 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:25,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:25,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:25,308 INFO L82 PathProgramCache]: Analyzing trace with hash -187641282, now seen corresponding path program 3 times [2018-11-14 16:39:25,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:25,309 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:25,332 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:39:25,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 16:39:25,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:25,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:25,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2701#true} is VALID [2018-11-14 16:39:25,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2018-11-14 16:39:25,816 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2701#true} #38#return; {2701#true} is VALID [2018-11-14 16:39:25,817 INFO L256 TraceCheckUtils]: 3: Hoare triple {2701#true} call #t~ret2 := main(); {2701#true} is VALID [2018-11-14 16:39:25,821 INFO L273 TraceCheckUtils]: 4: Hoare triple {2701#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2718#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:25,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {2718#(= main_~x~0 (_ bv0 32))} assume true; {2718#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:25,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {2718#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2718#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:25,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {2718#(= main_~x~0 (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2728#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {2728#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2728#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {2728#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2728#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {2728#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2738#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:25,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {2738#(= (_ bv2 32) main_~x~0)} assume true; {2738#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:25,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {2738#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2738#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:25,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {2738#(= (_ bv2 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2748#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {2748#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2748#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {2748#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2748#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {2748#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2758#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:25,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {2758#(= (_ bv4 32) main_~x~0)} assume true; {2758#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:25,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {2758#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2758#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:25,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {2758#(= (_ bv4 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2768#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {2768#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2768#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {2768#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2768#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {2768#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2778#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:25,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {2778#(= (_ bv6 32) main_~x~0)} assume true; {2778#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:25,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {2778#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {2778#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:25,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {2778#(= (_ bv6 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2788#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {2788#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {2788#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,846 INFO L273 TraceCheckUtils]: 27: Hoare triple {2788#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2788#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {2788#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2798#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {2798#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2798#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {2798#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2798#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {2798#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2808#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {2808#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {2808#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {2808#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {2808#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {2808#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2818#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {2818#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2818#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:25,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {2818#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {2702#false} is VALID [2018-11-14 16:39:25,864 INFO L256 TraceCheckUtils]: 37: Hoare triple {2702#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2702#false} is VALID [2018-11-14 16:39:25,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {2702#false} ~cond := #in~cond; {2702#false} is VALID [2018-11-14 16:39:25,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {2702#false} assume ~cond == 0bv32; {2702#false} is VALID [2018-11-14 16:39:25,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2018-11-14 16:39:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:25,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:26,903 INFO L273 TraceCheckUtils]: 40: Hoare triple {2702#false} assume !false; {2702#false} is VALID [2018-11-14 16:39:26,903 INFO L273 TraceCheckUtils]: 39: Hoare triple {2702#false} assume ~cond == 0bv32; {2702#false} is VALID [2018-11-14 16:39:26,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {2702#false} ~cond := #in~cond; {2702#false} is VALID [2018-11-14 16:39:26,904 INFO L256 TraceCheckUtils]: 37: Hoare triple {2702#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {2702#false} is VALID [2018-11-14 16:39:26,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {2849#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {2702#false} is VALID [2018-11-14 16:39:26,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {2849#(bvult main_~x~0 (_ bv99 32))} assume true; {2849#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:26,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {2856#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2849#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:26,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {2860#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2856#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:26,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {2860#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} assume true; {2860#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {2867#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2860#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {2867#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2867#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,934 INFO L273 TraceCheckUtils]: 29: Hoare triple {2867#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} assume true; {2867#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {2877#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2867#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {2877#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2877#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {2877#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume true; {2877#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {2887#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2877#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {2887#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2887#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {2887#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} assume true; {2887#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {2897#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2887#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {2897#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2897#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {2897#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} assume true; {2897#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {2907#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2897#(or (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {2907#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2907#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {2907#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} assume true; {2907#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {2917#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2907#(or (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {2917#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2917#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {2917#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} assume true; {2917#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {2927#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2917#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {2927#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {2927#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {2927#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume true; {2927#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {2937#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2927#(or (not (bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:26,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {2937#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2937#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {2937#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume true; {2937#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {2947#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2937#(or (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {2947#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {2947#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {2947#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} assume true; {2947#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,981 INFO L273 TraceCheckUtils]: 4: Hoare triple {2701#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {2947#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:26,981 INFO L256 TraceCheckUtils]: 3: Hoare triple {2701#true} call #t~ret2 := main(); {2701#true} is VALID [2018-11-14 16:39:26,981 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2701#true} {2701#true} #38#return; {2701#true} is VALID [2018-11-14 16:39:26,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {2701#true} assume true; {2701#true} is VALID [2018-11-14 16:39:26,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {2701#true} call ULTIMATE.init(); {2701#true} is VALID [2018-11-14 16:39:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-14 16:39:26,996 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-11-14 16:39:26,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:26,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 16:39:27,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:27,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 16:39:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 16:39:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:39:27,191 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 25 states. [2018-11-14 16:39:28,556 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 16:39:28,913 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-14 16:39:30,140 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-14 16:39:30,445 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-14 16:39:30,887 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-14 16:39:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:31,591 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-11-14 16:39:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:39:31,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2018-11-14 16:39:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:39:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 106 transitions. [2018-11-14 16:39:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 16:39:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 106 transitions. [2018-11-14 16:39:31,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 106 transitions. [2018-11-14 16:39:31,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:31,896 INFO L225 Difference]: With dead ends: 124 [2018-11-14 16:39:31,896 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 16:39:31,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 16:39:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 16:39:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-14 16:39:31,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:31,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 119 states. [2018-11-14 16:39:31,994 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-14 16:39:31,994 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-14 16:39:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:31,998 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-14 16:39:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-14 16:39:31,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:31,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:31,999 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-14 16:39:31,999 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-14 16:39:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:32,007 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-14 16:39:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-14 16:39:32,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:32,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:32,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:32,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 16:39:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-11-14 16:39:32,015 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 41 [2018-11-14 16:39:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:32,015 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-11-14 16:39:32,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 16:39:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-14 16:39:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 16:39:32,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:32,017 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:32,017 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:32,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 402425150, now seen corresponding path program 3 times [2018-11-14 16:39:32,018 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:32,018 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:32,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:39:32,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-14 16:39:32,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:32,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:32,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {3562#true} call ULTIMATE.init(); {3562#true} is VALID [2018-11-14 16:39:32,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 16:39:32,959 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3562#true} {3562#true} #38#return; {3562#true} is VALID [2018-11-14 16:39:32,960 INFO L256 TraceCheckUtils]: 3: Hoare triple {3562#true} call #t~ret2 := main(); {3562#true} is VALID [2018-11-14 16:39:32,961 INFO L273 TraceCheckUtils]: 4: Hoare triple {3562#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {3579#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:32,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {3579#(= main_~x~0 (_ bv0 32))} assume true; {3579#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:32,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {3579#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3579#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:32,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {3579#(= main_~x~0 (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3589#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {3589#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3589#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {3589#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3589#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {3589#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3599#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:32,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {3599#(= (_ bv4 32) main_~x~0)} assume true; {3599#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:32,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {3599#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3599#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:32,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {3599#(= (_ bv4 32) main_~x~0)} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3609#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {3609#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {3609#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {3609#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3609#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {3609#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3619#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {3619#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {3619#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {3619#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3619#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {3619#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3629#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {3629#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {3629#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {3629#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3629#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {3629#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3639#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {3639#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {3639#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {3639#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3639#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {3639#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3649#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-14 16:39:32,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {3649#(= (_ bv14 32) main_~x~0)} assume true; {3649#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-14 16:39:32,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {3649#(= (_ bv14 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {3649#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-14 16:39:32,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {3649#(= (_ bv14 32) main_~x~0)} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3659#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {3659#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {3659#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {3659#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3659#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {3659#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3669#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {3669#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {3669#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {3669#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3669#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {3669#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3679#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {3679#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {3679#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {3679#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3679#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {3679#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3689#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {3689#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3689#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {3689#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3689#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {3689#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3699#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {3699#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume true; {3699#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {3699#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3699#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,995 INFO L273 TraceCheckUtils]: 43: Hoare triple {3699#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3709#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {3709#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume true; {3709#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:32,996 INFO L273 TraceCheckUtils]: 45: Hoare triple {3709#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {3709#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:33,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {3709#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3719#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:33,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {3719#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume true; {3719#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:33,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {3719#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {3563#false} is VALID [2018-11-14 16:39:33,006 INFO L256 TraceCheckUtils]: 49: Hoare triple {3563#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3563#false} is VALID [2018-11-14 16:39:33,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {3563#false} ~cond := #in~cond; {3563#false} is VALID [2018-11-14 16:39:33,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {3563#false} assume ~cond == 0bv32; {3563#false} is VALID [2018-11-14 16:39:33,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {3563#false} assume !false; {3563#false} is VALID [2018-11-14 16:39:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:33,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:34,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {3563#false} assume !false; {3563#false} is VALID [2018-11-14 16:39:34,490 INFO L273 TraceCheckUtils]: 51: Hoare triple {3563#false} assume ~cond == 0bv32; {3563#false} is VALID [2018-11-14 16:39:34,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {3563#false} ~cond := #in~cond; {3563#false} is VALID [2018-11-14 16:39:34,491 INFO L256 TraceCheckUtils]: 49: Hoare triple {3563#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {3563#false} is VALID [2018-11-14 16:39:34,494 INFO L273 TraceCheckUtils]: 48: Hoare triple {3750#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {3563#false} is VALID [2018-11-14 16:39:34,494 INFO L273 TraceCheckUtils]: 47: Hoare triple {3750#(bvult main_~x~0 (_ bv99 32))} assume true; {3750#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:34,497 INFO L273 TraceCheckUtils]: 46: Hoare triple {3757#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3750#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:34,498 INFO L273 TraceCheckUtils]: 45: Hoare triple {3761#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {3757#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:34,498 INFO L273 TraceCheckUtils]: 44: Hoare triple {3761#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} assume true; {3761#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,503 INFO L273 TraceCheckUtils]: 43: Hoare triple {3768#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3761#(or (not (bvult main_~x~0 (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,503 INFO L273 TraceCheckUtils]: 42: Hoare triple {3768#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3768#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {3768#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} assume true; {3768#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {3778#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3768#(or (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {3778#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3778#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {3778#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} assume true; {3778#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {3788#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3778#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {3788#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {3788#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {3788#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} assume true; {3788#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {3798#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3788#(or (not (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {3798#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3798#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {3798#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} assume true; {3798#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {3808#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3798#(or (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {3808#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3808#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {3808#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} assume true; {3808#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {3818#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3808#(or (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {3818#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3818#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {3818#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} assume true; {3818#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {3828#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3818#(or (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {3828#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {3828#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {3828#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} assume true; {3828#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {3838#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3828#(or (not (bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {3838#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3838#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {3838#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} assume true; {3838#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {3848#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3838#(or (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {3848#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3848#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {3848#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} assume true; {3848#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {3858#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3848#(or (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {3858#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume !!~bvult32(~x~0, 99bv32); {3858#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {3858#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} assume true; {3858#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {3868#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3858#(or (not (bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))) (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32)))} is VALID [2018-11-14 16:39:34,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {3868#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3868#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {3868#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} assume true; {3868#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {3878#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3868#(or (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {3878#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3878#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {3878#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} assume true; {3878#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {3888#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {3878#(or (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {3888#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume !!~bvult32(~x~0, 99bv32); {3888#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {3888#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} assume true; {3888#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,584 INFO L273 TraceCheckUtils]: 4: Hoare triple {3562#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {3888#(or (bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32)) (not (bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))))} is VALID [2018-11-14 16:39:34,584 INFO L256 TraceCheckUtils]: 3: Hoare triple {3562#true} call #t~ret2 := main(); {3562#true} is VALID [2018-11-14 16:39:34,585 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3562#true} {3562#true} #38#return; {3562#true} is VALID [2018-11-14 16:39:34,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 16:39:34,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {3562#true} call ULTIMATE.init(); {3562#true} is VALID [2018-11-14 16:39:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:34,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:34,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-11-14 16:39:34,597 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-11-14 16:39:34,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:34,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 16:39:34,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:34,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 16:39:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 16:39:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 16:39:34,811 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 33 states. [2018-11-14 16:39:35,608 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 7 [2018-11-14 16:39:36,352 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 16:39:36,896 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 7 [2018-11-14 16:39:37,499 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 7 [2018-11-14 16:39:38,063 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 16:39:38,614 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-14 16:39:39,284 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-14 16:39:39,799 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-14 16:39:43,018 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-14 16:39:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:43,667 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2018-11-14 16:39:43,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 16:39:43,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-11-14 16:39:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:39:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 138 transitions. [2018-11-14 16:39:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:39:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 138 transitions. [2018-11-14 16:39:43,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 138 transitions. [2018-11-14 16:39:44,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:44,142 INFO L225 Difference]: With dead ends: 172 [2018-11-14 16:39:44,142 INFO L226 Difference]: Without dead ends: 167 [2018-11-14 16:39:44,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=798, Invalid=1458, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 16:39:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-14 16:39:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-14 16:39:44,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:44,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 167 states. [2018-11-14 16:39:44,302 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 167 states. [2018-11-14 16:39:44,303 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 167 states. [2018-11-14 16:39:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:44,306 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-11-14 16:39:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-11-14 16:39:44,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:44,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:44,307 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 167 states. [2018-11-14 16:39:44,307 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 167 states. [2018-11-14 16:39:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:44,311 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-11-14 16:39:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-11-14 16:39:44,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:44,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:44,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:44,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-14 16:39:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-11-14 16:39:44,316 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 53 [2018-11-14 16:39:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:44,317 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-11-14 16:39:44,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 16:39:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-11-14 16:39:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 16:39:44,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:44,318 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:44,318 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:44,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash -499371138, now seen corresponding path program 4 times [2018-11-14 16:39:44,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:44,319 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:39:44,350 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:39:44,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:39:44,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:44,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:45,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2018-11-14 16:39:45,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {4735#true} assume true; {4735#true} is VALID [2018-11-14 16:39:45,032 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4735#true} {4735#true} #38#return; {4735#true} is VALID [2018-11-14 16:39:45,032 INFO L256 TraceCheckUtils]: 3: Hoare triple {4735#true} call #t~ret2 := main(); {4735#true} is VALID [2018-11-14 16:39:45,033 INFO L273 TraceCheckUtils]: 4: Hoare triple {4735#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {4752#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:45,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {4752#(= main_~x~0 (_ bv0 32))} assume true; {4752#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:45,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {4752#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4752#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:39:45,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {4752#(= main_~x~0 (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4762#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {4762#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {4762#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {4762#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4762#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {4762#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4772#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:45,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {4772#(= (_ bv2 32) main_~x~0)} assume true; {4772#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:45,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {4772#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4772#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-14 16:39:45,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {4772#(= (_ bv2 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4782#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {4782#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4782#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {4782#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4782#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {4782#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4792#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:45,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {4792#(= (_ bv4 32) main_~x~0)} assume true; {4792#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:45,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {4792#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4792#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-14 16:39:45,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {4792#(= (_ bv4 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4802#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {4802#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {4802#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {4802#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4802#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {4802#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4812#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:45,045 INFO L273 TraceCheckUtils]: 23: Hoare triple {4812#(= (_ bv6 32) main_~x~0)} assume true; {4812#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:45,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {4812#(= (_ bv6 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4812#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-14 16:39:45,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {4812#(= (_ bv6 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4822#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {4822#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {4822#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,047 INFO L273 TraceCheckUtils]: 27: Hoare triple {4822#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4822#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {4822#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {4832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {4832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {4832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,049 INFO L273 TraceCheckUtils]: 31: Hoare triple {4832#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4842#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {4842#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {4842#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {4842#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4842#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {4842#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4852#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {4852#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {4852#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {4852#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4852#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,053 INFO L273 TraceCheckUtils]: 37: Hoare triple {4852#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4862#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,054 INFO L273 TraceCheckUtils]: 38: Hoare triple {4862#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {4862#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {4862#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4862#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,055 INFO L273 TraceCheckUtils]: 40: Hoare triple {4862#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4872#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,056 INFO L273 TraceCheckUtils]: 41: Hoare triple {4872#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {4872#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,056 INFO L273 TraceCheckUtils]: 42: Hoare triple {4872#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4872#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {4872#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4882#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-14 16:39:45,058 INFO L273 TraceCheckUtils]: 44: Hoare triple {4882#(= (_ bv13 32) main_~x~0)} assume true; {4882#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-14 16:39:45,058 INFO L273 TraceCheckUtils]: 45: Hoare triple {4882#(= (_ bv13 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4882#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-14 16:39:45,059 INFO L273 TraceCheckUtils]: 46: Hoare triple {4882#(= (_ bv13 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4892#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,060 INFO L273 TraceCheckUtils]: 47: Hoare triple {4892#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {4892#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {4892#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4892#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,061 INFO L273 TraceCheckUtils]: 49: Hoare triple {4892#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4902#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,062 INFO L273 TraceCheckUtils]: 50: Hoare triple {4902#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {4902#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {4902#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4902#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,063 INFO L273 TraceCheckUtils]: 52: Hoare triple {4902#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4912#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-14 16:39:45,064 INFO L273 TraceCheckUtils]: 53: Hoare triple {4912#(= (_ bv16 32) main_~x~0)} assume true; {4912#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-14 16:39:45,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {4912#(= (_ bv16 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4912#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-14 16:39:45,065 INFO L273 TraceCheckUtils]: 55: Hoare triple {4912#(= (_ bv16 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4922#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,065 INFO L273 TraceCheckUtils]: 56: Hoare triple {4922#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {4922#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,066 INFO L273 TraceCheckUtils]: 57: Hoare triple {4922#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4922#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {4922#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4932#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,067 INFO L273 TraceCheckUtils]: 59: Hoare triple {4932#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {4932#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {4932#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4932#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,069 INFO L273 TraceCheckUtils]: 61: Hoare triple {4932#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4942#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,069 INFO L273 TraceCheckUtils]: 62: Hoare triple {4942#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {4942#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,070 INFO L273 TraceCheckUtils]: 63: Hoare triple {4942#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4942#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,070 INFO L273 TraceCheckUtils]: 64: Hoare triple {4942#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4952#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,071 INFO L273 TraceCheckUtils]: 65: Hoare triple {4952#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {4952#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,072 INFO L273 TraceCheckUtils]: 66: Hoare triple {4952#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {4952#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,072 INFO L273 TraceCheckUtils]: 67: Hoare triple {4952#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4962#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-14 16:39:45,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {4962#(= (_ bv21 32) main_~x~0)} assume true; {4962#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-14 16:39:45,074 INFO L273 TraceCheckUtils]: 69: Hoare triple {4962#(= (_ bv21 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {4962#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-14 16:39:45,074 INFO L273 TraceCheckUtils]: 70: Hoare triple {4962#(= (_ bv21 32) main_~x~0)} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4972#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,075 INFO L273 TraceCheckUtils]: 71: Hoare triple {4972#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {4972#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:45,075 INFO L273 TraceCheckUtils]: 72: Hoare triple {4972#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvult32(~x~0, 99bv32); {4736#false} is VALID [2018-11-14 16:39:45,076 INFO L256 TraceCheckUtils]: 73: Hoare triple {4736#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {4736#false} is VALID [2018-11-14 16:39:45,076 INFO L273 TraceCheckUtils]: 74: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2018-11-14 16:39:45,076 INFO L273 TraceCheckUtils]: 75: Hoare triple {4736#false} assume ~cond == 0bv32; {4736#false} is VALID [2018-11-14 16:39:45,076 INFO L273 TraceCheckUtils]: 76: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2018-11-14 16:39:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:45,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:47,463 INFO L273 TraceCheckUtils]: 76: Hoare triple {4736#false} assume !false; {4736#false} is VALID [2018-11-14 16:39:47,464 INFO L273 TraceCheckUtils]: 75: Hoare triple {4736#false} assume ~cond == 0bv32; {4736#false} is VALID [2018-11-14 16:39:47,465 INFO L273 TraceCheckUtils]: 74: Hoare triple {4736#false} ~cond := #in~cond; {4736#false} is VALID [2018-11-14 16:39:47,465 INFO L256 TraceCheckUtils]: 73: Hoare triple {4736#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {4736#false} is VALID [2018-11-14 16:39:47,480 INFO L273 TraceCheckUtils]: 72: Hoare triple {5003#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {4736#false} is VALID [2018-11-14 16:39:47,480 INFO L273 TraceCheckUtils]: 71: Hoare triple {5003#(bvult main_~x~0 (_ bv99 32))} assume true; {5003#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:47,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {5010#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5003#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:39:47,481 INFO L273 TraceCheckUtils]: 69: Hoare triple {5010#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5010#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {5010#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} assume true; {5010#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,486 INFO L273 TraceCheckUtils]: 67: Hoare triple {5020#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5010#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,487 INFO L273 TraceCheckUtils]: 66: Hoare triple {5020#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5020#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,487 INFO L273 TraceCheckUtils]: 65: Hoare triple {5020#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume true; {5020#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,492 INFO L273 TraceCheckUtils]: 64: Hoare triple {5030#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5020#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {5030#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5030#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {5030#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} assume true; {5030#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,497 INFO L273 TraceCheckUtils]: 61: Hoare triple {5040#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5030#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {5040#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5040#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {5040#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume true; {5040#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,504 INFO L273 TraceCheckUtils]: 58: Hoare triple {5050#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5040#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,504 INFO L273 TraceCheckUtils]: 57: Hoare triple {5050#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5050#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {5050#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} assume true; {5050#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {5060#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5050#(bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,510 INFO L273 TraceCheckUtils]: 54: Hoare triple {5060#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5060#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {5060#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume true; {5060#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,515 INFO L273 TraceCheckUtils]: 52: Hoare triple {5070#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5060#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,516 INFO L273 TraceCheckUtils]: 51: Hoare triple {5070#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5070#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {5070#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} assume true; {5070#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {5080#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5070#(bvult (bvadd main_~x~0 (_ bv7 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {5080#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5080#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {5080#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume true; {5080#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {5090#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5080#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {5090#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5090#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {5090#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} assume true; {5090#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {5100#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5090#(bvult (bvadd main_~x~0 (_ bv9 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {5100#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5100#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {5100#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume true; {5100#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {5110#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5100#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {5110#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5110#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,539 INFO L273 TraceCheckUtils]: 38: Hoare triple {5110#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} assume true; {5110#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {5120#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5110#(bvult (bvadd main_~x~0 (_ bv11 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {5120#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5120#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {5120#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume true; {5120#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {5130#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5120#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {5130#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5130#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {5130#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} assume true; {5130#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {5140#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5130#(bvult (bvadd main_~x~0 (_ bv13 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {5140#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5140#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {5140#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume true; {5140#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {5150#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5140#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,561 INFO L273 TraceCheckUtils]: 27: Hoare triple {5150#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5150#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {5150#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} assume true; {5150#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {5160#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5150#(bvult (bvadd main_~x~0 (_ bv15 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {5160#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5160#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {5160#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume true; {5160#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {5170#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5160#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {5170#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5170#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {5170#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} assume true; {5170#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {5180#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5170#(bvult (bvadd main_~x~0 (_ bv17 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {5180#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5180#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {5180#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume true; {5180#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {5190#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5180#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {5190#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5190#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {5190#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} assume true; {5190#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {5200#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5190#(bvult (bvadd main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {5200#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5200#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {5200#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume true; {5200#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {5210#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5200#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {5210#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5210#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {5210#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} assume true; {5210#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {5220#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume ~bvurem32(~y~0, 2bv32) == 0bv32;#t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5210#(bvult (bvadd main_~x~0 (_ bv21 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {5220#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {5220#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {5220#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume true; {5220#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,605 INFO L273 TraceCheckUtils]: 4: Hoare triple {4735#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {5220#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-14 16:39:47,605 INFO L256 TraceCheckUtils]: 3: Hoare triple {4735#true} call #t~ret2 := main(); {4735#true} is VALID [2018-11-14 16:39:47,606 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4735#true} {4735#true} #38#return; {4735#true} is VALID [2018-11-14 16:39:47,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {4735#true} assume true; {4735#true} is VALID [2018-11-14 16:39:47,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {4735#true} call ULTIMATE.init(); {4735#true} is VALID [2018-11-14 16:39:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:47,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:47,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 16:39:47,620 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 77 [2018-11-14 16:39:47,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:47,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 16:39:47,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:47,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 16:39:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 16:39:47,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 16:39:47,948 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 48 states. [2018-11-14 16:39:52,568 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 16:39:59,718 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 16:40:00,387 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 16:40:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:04,551 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2018-11-14 16:40:04,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 16:40:04,552 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 77 [2018-11-14 16:40:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:40:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 202 transitions. [2018-11-14 16:40:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:40:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 202 transitions. [2018-11-14 16:40:04,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 202 transitions. [2018-11-14 16:40:05,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:05,225 INFO L225 Difference]: With dead ends: 244 [2018-11-14 16:40:05,226 INFO L226 Difference]: Without dead ends: 239 [2018-11-14 16:40:05,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 16:40:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-14 16:40:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-11-14 16:40:05,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:05,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 239 states. [2018-11-14 16:40:05,395 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2018-11-14 16:40:05,395 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2018-11-14 16:40:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:05,402 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-11-14 16:40:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2018-11-14 16:40:05,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:05,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:05,403 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2018-11-14 16:40:05,403 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2018-11-14 16:40:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:05,410 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-11-14 16:40:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2018-11-14 16:40:05,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:05,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:05,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:05,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-14 16:40:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 241 transitions. [2018-11-14 16:40:05,417 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 241 transitions. Word has length 77 [2018-11-14 16:40:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:05,418 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 241 transitions. [2018-11-14 16:40:05,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 16:40:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2018-11-14 16:40:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-14 16:40:05,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:05,419 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:05,420 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:05,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 364782142, now seen corresponding path program 4 times [2018-11-14 16:40:05,420 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:05,421 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:05,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:40:05,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:40:05,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:40:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:05,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:40:07,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {6417#true} call ULTIMATE.init(); {6417#true} is VALID [2018-11-14 16:40:07,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {6417#true} assume true; {6417#true} is VALID [2018-11-14 16:40:07,312 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6417#true} {6417#true} #38#return; {6417#true} is VALID [2018-11-14 16:40:07,312 INFO L256 TraceCheckUtils]: 3: Hoare triple {6417#true} call #t~ret2 := main(); {6417#true} is VALID [2018-11-14 16:40:07,312 INFO L273 TraceCheckUtils]: 4: Hoare triple {6417#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {6434#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:07,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {6434#(= main_~x~0 (_ bv0 32))} assume true; {6434#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:07,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {6434#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6434#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-14 16:40:07,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {6434#(= main_~x~0 (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6444#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {6444#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {6444#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {6444#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6444#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {6444#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {6454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {6454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {6454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {6454#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6464#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {6464#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {6464#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {6464#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6464#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {6464#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6474#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {6474#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {6474#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {6474#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6474#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {6474#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6484#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {6484#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {6484#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {6484#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6484#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {6484#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6494#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,322 INFO L273 TraceCheckUtils]: 23: Hoare triple {6494#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {6494#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {6494#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6494#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {6494#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6504#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {6504#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {6504#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {6504#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6504#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {6504#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6514#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {6514#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {6514#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {6514#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6514#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {6514#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6524#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {6524#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {6524#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {6524#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6524#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {6524#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6534#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {6534#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {6534#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {6534#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6534#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,331 INFO L273 TraceCheckUtils]: 37: Hoare triple {6534#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6544#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {6544#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {6544#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,332 INFO L273 TraceCheckUtils]: 39: Hoare triple {6544#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6544#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {6544#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6554#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {6554#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume true; {6554#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,334 INFO L273 TraceCheckUtils]: 42: Hoare triple {6554#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6554#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {6554#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6564#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {6564#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume true; {6564#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,336 INFO L273 TraceCheckUtils]: 45: Hoare triple {6564#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6564#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,336 INFO L273 TraceCheckUtils]: 46: Hoare triple {6564#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6574#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,337 INFO L273 TraceCheckUtils]: 47: Hoare triple {6574#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume true; {6574#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,337 INFO L273 TraceCheckUtils]: 48: Hoare triple {6574#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6574#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,338 INFO L273 TraceCheckUtils]: 49: Hoare triple {6574#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6584#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,339 INFO L273 TraceCheckUtils]: 50: Hoare triple {6584#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume true; {6584#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,339 INFO L273 TraceCheckUtils]: 51: Hoare triple {6584#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6584#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,340 INFO L273 TraceCheckUtils]: 52: Hoare triple {6584#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6594#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,340 INFO L273 TraceCheckUtils]: 53: Hoare triple {6594#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume true; {6594#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,341 INFO L273 TraceCheckUtils]: 54: Hoare triple {6594#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6594#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,342 INFO L273 TraceCheckUtils]: 55: Hoare triple {6594#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6604#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,342 INFO L273 TraceCheckUtils]: 56: Hoare triple {6604#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume true; {6604#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,343 INFO L273 TraceCheckUtils]: 57: Hoare triple {6604#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6604#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,344 INFO L273 TraceCheckUtils]: 58: Hoare triple {6604#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6614#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,344 INFO L273 TraceCheckUtils]: 59: Hoare triple {6614#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume true; {6614#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,345 INFO L273 TraceCheckUtils]: 60: Hoare triple {6614#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6614#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,346 INFO L273 TraceCheckUtils]: 61: Hoare triple {6614#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6624#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,346 INFO L273 TraceCheckUtils]: 62: Hoare triple {6624#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume true; {6624#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,347 INFO L273 TraceCheckUtils]: 63: Hoare triple {6624#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6624#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {6624#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6634#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {6634#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume true; {6634#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,349 INFO L273 TraceCheckUtils]: 66: Hoare triple {6634#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6634#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,349 INFO L273 TraceCheckUtils]: 67: Hoare triple {6634#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6644#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-14 16:40:07,350 INFO L273 TraceCheckUtils]: 68: Hoare triple {6644#(= (_ bv42 32) main_~x~0)} assume true; {6644#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-14 16:40:07,351 INFO L273 TraceCheckUtils]: 69: Hoare triple {6644#(= (_ bv42 32) main_~x~0)} assume !!~bvult32(~x~0, 99bv32); {6644#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-14 16:40:07,351 INFO L273 TraceCheckUtils]: 70: Hoare triple {6644#(= (_ bv42 32) main_~x~0)} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6654#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,352 INFO L273 TraceCheckUtils]: 71: Hoare triple {6654#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume true; {6654#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,352 INFO L273 TraceCheckUtils]: 72: Hoare triple {6654#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6654#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {6654#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6664#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,354 INFO L273 TraceCheckUtils]: 74: Hoare triple {6664#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume true; {6664#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {6664#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6664#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,378 INFO L273 TraceCheckUtils]: 76: Hoare triple {6664#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6674#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,384 INFO L273 TraceCheckUtils]: 77: Hoare triple {6674#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume true; {6674#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {6674#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6674#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,385 INFO L273 TraceCheckUtils]: 79: Hoare triple {6674#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6684#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,386 INFO L273 TraceCheckUtils]: 80: Hoare triple {6684#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume true; {6684#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,386 INFO L273 TraceCheckUtils]: 81: Hoare triple {6684#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6684#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,387 INFO L273 TraceCheckUtils]: 82: Hoare triple {6684#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6694#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,387 INFO L273 TraceCheckUtils]: 83: Hoare triple {6694#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume true; {6694#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {6694#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6694#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,388 INFO L273 TraceCheckUtils]: 85: Hoare triple {6694#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6704#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,388 INFO L273 TraceCheckUtils]: 86: Hoare triple {6704#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} assume true; {6704#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,389 INFO L273 TraceCheckUtils]: 87: Hoare triple {6704#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6704#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,390 INFO L273 TraceCheckUtils]: 88: Hoare triple {6704#(= (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6714#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,390 INFO L273 TraceCheckUtils]: 89: Hoare triple {6714#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume true; {6714#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,391 INFO L273 TraceCheckUtils]: 90: Hoare triple {6714#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6714#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,391 INFO L273 TraceCheckUtils]: 91: Hoare triple {6714#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6724#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,392 INFO L273 TraceCheckUtils]: 92: Hoare triple {6724#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume true; {6724#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,392 INFO L273 TraceCheckUtils]: 93: Hoare triple {6724#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 99bv32); {6724#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-14 16:40:07,393 INFO L273 TraceCheckUtils]: 94: Hoare triple {6724#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6734#(= (_ bv60 32) main_~x~0)} is VALID [2018-11-14 16:40:07,394 INFO L273 TraceCheckUtils]: 95: Hoare triple {6734#(= (_ bv60 32) main_~x~0)} assume true; {6734#(= (_ bv60 32) main_~x~0)} is VALID [2018-11-14 16:40:07,394 INFO L273 TraceCheckUtils]: 96: Hoare triple {6734#(= (_ bv60 32) main_~x~0)} assume !~bvult32(~x~0, 99bv32); {6418#false} is VALID [2018-11-14 16:40:07,395 INFO L256 TraceCheckUtils]: 97: Hoare triple {6418#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {6418#false} is VALID [2018-11-14 16:40:07,395 INFO L273 TraceCheckUtils]: 98: Hoare triple {6418#false} ~cond := #in~cond; {6418#false} is VALID [2018-11-14 16:40:07,395 INFO L273 TraceCheckUtils]: 99: Hoare triple {6418#false} assume ~cond == 0bv32; {6418#false} is VALID [2018-11-14 16:40:07,395 INFO L273 TraceCheckUtils]: 100: Hoare triple {6418#false} assume !false; {6418#false} is VALID [2018-11-14 16:40:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:40:07,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:40:10,707 INFO L273 TraceCheckUtils]: 100: Hoare triple {6418#false} assume !false; {6418#false} is VALID [2018-11-14 16:40:10,707 INFO L273 TraceCheckUtils]: 99: Hoare triple {6418#false} assume ~cond == 0bv32; {6418#false} is VALID [2018-11-14 16:40:10,708 INFO L273 TraceCheckUtils]: 98: Hoare triple {6418#false} ~cond := #in~cond; {6418#false} is VALID [2018-11-14 16:40:10,708 INFO L256 TraceCheckUtils]: 97: Hoare triple {6418#false} call __VERIFIER_assert((if ~bvurem32(~x~0, 2bv32) == ~bvurem32(~y~0, 2bv32) then 1bv32 else 0bv32)); {6418#false} is VALID [2018-11-14 16:40:10,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {6765#(bvult main_~x~0 (_ bv99 32))} assume !~bvult32(~x~0, 99bv32); {6418#false} is VALID [2018-11-14 16:40:10,709 INFO L273 TraceCheckUtils]: 95: Hoare triple {6765#(bvult main_~x~0 (_ bv99 32))} assume true; {6765#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:40:10,711 INFO L273 TraceCheckUtils]: 94: Hoare triple {6772#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6765#(bvult main_~x~0 (_ bv99 32))} is VALID [2018-11-14 16:40:10,711 INFO L273 TraceCheckUtils]: 93: Hoare triple {6772#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6772#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,711 INFO L273 TraceCheckUtils]: 92: Hoare triple {6772#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} assume true; {6772#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,718 INFO L273 TraceCheckUtils]: 91: Hoare triple {6782#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6772#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,718 INFO L273 TraceCheckUtils]: 90: Hoare triple {6782#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6782#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,719 INFO L273 TraceCheckUtils]: 89: Hoare triple {6782#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} assume true; {6782#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,723 INFO L273 TraceCheckUtils]: 88: Hoare triple {6792#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6782#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,723 INFO L273 TraceCheckUtils]: 87: Hoare triple {6792#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6792#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,724 INFO L273 TraceCheckUtils]: 86: Hoare triple {6792#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} assume true; {6792#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,728 INFO L273 TraceCheckUtils]: 85: Hoare triple {6802#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6792#(bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,729 INFO L273 TraceCheckUtils]: 84: Hoare triple {6802#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6802#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,729 INFO L273 TraceCheckUtils]: 83: Hoare triple {6802#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} assume true; {6802#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,733 INFO L273 TraceCheckUtils]: 82: Hoare triple {6812#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6802#(bvult (bvadd main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {6812#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6812#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,734 INFO L273 TraceCheckUtils]: 80: Hoare triple {6812#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} assume true; {6812#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,739 INFO L273 TraceCheckUtils]: 79: Hoare triple {6822#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6812#(bvult (bvadd main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,740 INFO L273 TraceCheckUtils]: 78: Hoare triple {6822#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6822#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,740 INFO L273 TraceCheckUtils]: 77: Hoare triple {6822#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} assume true; {6822#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,744 INFO L273 TraceCheckUtils]: 76: Hoare triple {6832#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6822#(bvult (bvadd main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {6832#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6832#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,745 INFO L273 TraceCheckUtils]: 74: Hoare triple {6832#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} assume true; {6832#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {6842#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6832#(bvult (bvadd main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {6842#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6842#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {6842#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} assume true; {6842#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,756 INFO L273 TraceCheckUtils]: 70: Hoare triple {6852#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6842#(bvult (bvadd main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,757 INFO L273 TraceCheckUtils]: 69: Hoare triple {6852#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6852#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {6852#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} assume true; {6852#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,762 INFO L273 TraceCheckUtils]: 67: Hoare triple {6862#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6852#(bvult (bvadd main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,762 INFO L273 TraceCheckUtils]: 66: Hoare triple {6862#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6862#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,763 INFO L273 TraceCheckUtils]: 65: Hoare triple {6862#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} assume true; {6862#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,767 INFO L273 TraceCheckUtils]: 64: Hoare triple {6872#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6862#(bvult (bvadd main_~x~0 (_ bv20 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {6872#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6872#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {6872#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} assume true; {6872#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,773 INFO L273 TraceCheckUtils]: 61: Hoare triple {6882#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6872#(bvult (bvadd main_~x~0 (_ bv22 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,773 INFO L273 TraceCheckUtils]: 60: Hoare triple {6882#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6882#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,773 INFO L273 TraceCheckUtils]: 59: Hoare triple {6882#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} assume true; {6882#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {6892#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6882#(bvult (bvadd main_~x~0 (_ bv24 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,779 INFO L273 TraceCheckUtils]: 57: Hoare triple {6892#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6892#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,779 INFO L273 TraceCheckUtils]: 56: Hoare triple {6892#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} assume true; {6892#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,787 INFO L273 TraceCheckUtils]: 55: Hoare triple {6902#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6892#(bvult (bvadd main_~x~0 (_ bv26 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,787 INFO L273 TraceCheckUtils]: 54: Hoare triple {6902#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6902#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,787 INFO L273 TraceCheckUtils]: 53: Hoare triple {6902#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} assume true; {6902#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,791 INFO L273 TraceCheckUtils]: 52: Hoare triple {6912#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6902#(bvult (bvadd main_~x~0 (_ bv28 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {6912#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6912#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {6912#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} assume true; {6912#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,796 INFO L273 TraceCheckUtils]: 49: Hoare triple {6922#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6912#(bvult (bvadd main_~x~0 (_ bv30 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {6922#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6922#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,797 INFO L273 TraceCheckUtils]: 47: Hoare triple {6922#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} assume true; {6922#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,800 INFO L273 TraceCheckUtils]: 46: Hoare triple {6932#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6922#(bvult (bvadd main_~x~0 (_ bv32 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,801 INFO L273 TraceCheckUtils]: 45: Hoare triple {6932#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6932#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {6932#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} assume true; {6932#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {6942#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6932#(bvult (bvadd main_~x~0 (_ bv34 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {6942#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6942#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {6942#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} assume true; {6942#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {6952#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6942#(bvult (bvadd main_~x~0 (_ bv36 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,812 INFO L273 TraceCheckUtils]: 39: Hoare triple {6952#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6952#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,812 INFO L273 TraceCheckUtils]: 38: Hoare triple {6952#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} assume true; {6952#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {6962#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6952#(bvult (bvadd main_~x~0 (_ bv38 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {6962#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6962#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {6962#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} assume true; {6962#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,822 INFO L273 TraceCheckUtils]: 34: Hoare triple {6972#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6962#(bvult (bvadd main_~x~0 (_ bv40 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {6972#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6972#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {6972#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} assume true; {6972#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,831 INFO L273 TraceCheckUtils]: 31: Hoare triple {6982#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6972#(bvult (bvadd main_~x~0 (_ bv42 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,831 INFO L273 TraceCheckUtils]: 30: Hoare triple {6982#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6982#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {6982#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} assume true; {6982#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {6992#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6982#(bvult (bvadd main_~x~0 (_ bv44 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {6992#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {6992#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {6992#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} assume true; {6992#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {7002#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {6992#(bvult (bvadd main_~x~0 (_ bv46 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {7002#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7002#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {7002#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} assume true; {7002#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {7012#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {7002#(bvult (bvadd main_~x~0 (_ bv48 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {7012#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7012#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {7012#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} assume true; {7012#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,852 INFO L273 TraceCheckUtils]: 19: Hoare triple {7022#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {7012#(bvult (bvadd main_~x~0 (_ bv50 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {7022#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7022#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {7022#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} assume true; {7022#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {7032#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {7022#(bvult (bvadd main_~x~0 (_ bv52 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {7032#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7032#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {7032#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} assume true; {7032#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {7042#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {7032#(bvult (bvadd main_~x~0 (_ bv54 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {7042#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7042#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {7042#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} assume true; {7042#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {7052#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {7042#(bvult (bvadd main_~x~0 (_ bv56 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {7052#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7052#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {7052#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} assume true; {7052#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {7062#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} assume !(~bvurem32(~y~0, 2bv32) == 0bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {7052#(bvult (bvadd main_~x~0 (_ bv58 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {7062#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} assume !!~bvult32(~x~0, 99bv32); {7062#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {7062#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} assume true; {7062#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,946 INFO L273 TraceCheckUtils]: 4: Hoare triple {6417#true} ~x~0 := 0bv32;~y~0 := #t~nondet0;havoc #t~nondet0; {7062#(bvult (bvadd main_~x~0 (_ bv60 32)) (_ bv99 32))} is VALID [2018-11-14 16:40:10,947 INFO L256 TraceCheckUtils]: 3: Hoare triple {6417#true} call #t~ret2 := main(); {6417#true} is VALID [2018-11-14 16:40:10,947 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6417#true} {6417#true} #38#return; {6417#true} is VALID [2018-11-14 16:40:10,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {6417#true} assume true; {6417#true} is VALID [2018-11-14 16:40:10,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {6417#true} call ULTIMATE.init(); {6417#true} is VALID [2018-11-14 16:40:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:40:10,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:40:10,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-11-14 16:40:10,968 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 101 [2018-11-14 16:40:10,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:40:10,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2018-11-14 16:40:11,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:11,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-14 16:40:11,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-14 16:40:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-14 16:40:11,436 INFO L87 Difference]: Start difference. First operand 239 states and 241 transitions. Second operand 64 states. [2018-11-14 16:40:13,044 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-14 16:40:14,450 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-14 16:40:15,917 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-14 16:40:17,683 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-14 16:40:20,766 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-14 16:40:22,199 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-14 16:40:23,588 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-14 16:40:24,895 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-14 16:40:26,427 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 16:40:27,754 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 16:40:29,029 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 16:40:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:45,774 INFO L93 Difference]: Finished difference Result 304 states and 325 transitions. [2018-11-14 16:40:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-14 16:40:45,775 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 101 [2018-11-14 16:40:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:40:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 16:40:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 242 transitions. [2018-11-14 16:40:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 16:40:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 242 transitions. [2018-11-14 16:40:45,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 242 transitions. [2018-11-14 16:40:46,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:40:46,823 INFO L225 Difference]: With dead ends: 304 [2018-11-14 16:40:46,823 INFO L226 Difference]: Without dead ends: 299 [2018-11-14 16:40:46,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=2874, Invalid=5868, Unknown=0, NotChecked=0, Total=8742 [2018-11-14 16:40:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-14 16:40:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-11-14 16:40:47,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:40:47,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand 299 states. [2018-11-14 16:40:47,172 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand 299 states. [2018-11-14 16:40:47,172 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 299 states. [2018-11-14 16:40:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:47,180 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-11-14 16:40:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 301 transitions. [2018-11-14 16:40:47,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:47,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:47,181 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand 299 states. [2018-11-14 16:40:47,181 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 299 states. [2018-11-14 16:40:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:40:47,189 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-11-14 16:40:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 301 transitions. [2018-11-14 16:40:47,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:40:47,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:40:47,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:40:47,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:40:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-14 16:40:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 301 transitions. [2018-11-14 16:40:47,199 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 301 transitions. Word has length 101 [2018-11-14 16:40:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:40:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 301 transitions. [2018-11-14 16:40:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-14 16:40:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 301 transitions. [2018-11-14 16:40:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-14 16:40:47,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:40:47,202 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:40:47,202 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:40:47,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:40:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -148105730, now seen corresponding path program 5 times [2018-11-14 16:40:47,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:40:47,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:40:47,227 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-14 16:40:50,838 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-14 16:40:50,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:40:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:40:50,918 INFO L273 TraceCheckSpWp]: Computing forward predicates...