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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:45:42,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:45:42,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:45:42,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:45:42,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:45:42,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:45:42,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:45:42,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:45:42,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:45:42,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:45:42,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:45:42,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:45:42,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:45:42,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:45:42,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:45:42,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:45:42,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:45:42,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:45:42,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:45:42,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:45:42,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:45:42,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:45:42,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:45:42,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:45:42,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:45:42,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:45:42,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:45:42,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:45:42,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:45:42,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:45:42,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:45:42,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:45:42,360 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:45:42,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:45:42,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:45:42,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:45:42,362 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-23 11:45:42,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:45:42,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:45:42,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:45:42,395 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:45:42,396 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:45:42,396 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:45:42,396 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:45:42,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:45:42,398 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:45:42,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:45:42,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:45:42,398 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:45:42,398 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:45:42,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:45:42,399 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:45:42,399 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:45:42,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:45:42,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:45:42,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:45:42,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:45:42,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:45:42,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:45:42,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:45:42,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:45:42,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:45:42,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:45:42,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:45:42,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:45:42,403 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:45:42,403 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:45:42,403 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:45:42,403 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:45:42,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:45:42,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:45:42,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:45:42,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:45:42,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:45:42,495 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:45:42,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-23 11:45:42,564 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8597428c/6a2cee7b3a4b4b318eb9f1b544145cad/FLAGaf2246a32 [2018-11-23 11:45:43,035 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:45:43,036 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-23 11:45:43,044 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8597428c/6a2cee7b3a4b4b318eb9f1b544145cad/FLAGaf2246a32 [2018-11-23 11:45:43,400 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8597428c/6a2cee7b3a4b4b318eb9f1b544145cad [2018-11-23 11:45:43,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:45:43,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:45:43,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:45:43,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:45:43,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:45:43,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c12378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43, skipping insertion in model container [2018-11-23 11:45:43,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:45:43,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:45:43,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:45:43,689 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:45:43,715 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:45:43,736 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:45:43,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43 WrapperNode [2018-11-23 11:45:43,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:45:43,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:45:43,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:45:43,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:45:43,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:45:43,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:45:43,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:45:43,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:45:43,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (1/1) ... [2018-11-23 11:45:43,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:45:43,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:45:43,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:45:43,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:45:43,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (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-23 11:45:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-11-23 11:45:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-11-23 11:45:44,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:45:44,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:45:44,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:45:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:45:44,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:45:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:45:44,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:45:44,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:45:44,563 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:45:44,563 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:45:44,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:45:44 BoogieIcfgContainer [2018-11-23 11:45:44,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:45:44,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:45:44,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:45:44,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:45:44,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:45:43" (1/3) ... [2018-11-23 11:45:44,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7b3da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:45:44, skipping insertion in model container [2018-11-23 11:45:44,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:45:43" (2/3) ... [2018-11-23 11:45:44,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7b3da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:45:44, skipping insertion in model container [2018-11-23 11:45:44,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:45:44" (3/3) ... [2018-11-23 11:45:44,576 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-11-23 11:45:44,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:45:44,593 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:45:44,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:45:44,646 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:45:44,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:45:44,647 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:45:44,647 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:45:44,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:45:44,648 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:45:44,648 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:45:44,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:45:44,649 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:45:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:45:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:45:44,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:44,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:44,680 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:44,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -576830929, now seen corresponding path program 1 times [2018-11-23 11:45:44,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:44,693 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-23 11:45:44,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:44,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:44,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:45:44,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} ~last~0 := 0bv32; {30#true} is VALID [2018-11-23 11:45:44,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:45:44,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #65#return; {30#true} is VALID [2018-11-23 11:45:44,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-23 11:45:44,879 INFO L256 TraceCheckUtils]: 5: Hoare triple {30#true} call #t~ret0 := nondet(); {30#true} is VALID [2018-11-23 11:45:44,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} havoc ~x~0;#res := ~x~0; {30#true} is VALID [2018-11-23 11:45:44,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:45:44,880 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {30#true} {30#true} #69#return; {30#true} is VALID [2018-11-23 11:45:44,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {30#true} is VALID [2018-11-23 11:45:44,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {30#true} is VALID [2018-11-23 11:45:44,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:45:44,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {31#false} is VALID [2018-11-23 11:45:44,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {31#false} is VALID [2018-11-23 11:45:44,883 INFO L256 TraceCheckUtils]: 14: Hoare triple {31#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 11:45:44,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:45:44,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 11:45:44,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:45:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:44,888 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:45:44,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:45:44,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:45:44,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 11:45:44,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:44,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:45:45,072 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-23 11:45:45,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:45:45,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:45:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:45:45,087 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:45:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:45,358 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2018-11-23 11:45:45,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:45:45,359 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 11:45:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:45:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 11:45:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:45:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 11:45:45,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-23 11:45:45,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:45,570 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:45:45,571 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:45:45,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-23 11:45:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:45:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:45:45,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:45,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:45:45,658 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:45:45,658 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:45:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:45,663 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:45:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:45:45,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:45,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:45,664 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:45:45,664 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:45:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:45,669 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:45:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:45:45,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:45,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:45,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:45,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:45:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 11:45:45,676 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2018-11-23 11:45:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:45,676 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 11:45:45,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:45:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:45:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:45:45,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:45,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:45,679 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:45,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1749436828, now seen corresponding path program 1 times [2018-11-23 11:45:45,680 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:45,680 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-23 11:45:45,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:45,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:45,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 11:45:45,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} ~last~0 := 0bv32; {216#true} is VALID [2018-11-23 11:45:45,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 11:45:45,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #65#return; {216#true} is VALID [2018-11-23 11:45:45,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret2 := main(); {216#true} is VALID [2018-11-23 11:45:45,833 INFO L256 TraceCheckUtils]: 5: Hoare triple {216#true} call #t~ret0 := nondet(); {216#true} is VALID [2018-11-23 11:45:45,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {216#true} havoc ~x~0;#res := ~x~0; {216#true} is VALID [2018-11-23 11:45:45,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 11:45:45,836 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {216#true} {216#true} #69#return; {216#true} is VALID [2018-11-23 11:45:45,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {216#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {216#true} is VALID [2018-11-23 11:45:45,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {216#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {251#(= (_ bv1 32) main_~st~0)} is VALID [2018-11-23 11:45:45,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#(= (_ bv1 32) main_~st~0)} assume !~bvslt32(~c~0, 200000bv32); {251#(= (_ bv1 32) main_~st~0)} is VALID [2018-11-23 11:45:45,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {251#(= (_ bv1 32) main_~st~0)} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {217#false} is VALID [2018-11-23 11:45:45,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {217#false} is VALID [2018-11-23 11:45:45,882 INFO L256 TraceCheckUtils]: 14: Hoare triple {217#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {217#false} is VALID [2018-11-23 11:45:45,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} ~cond := #in~cond; {217#false} is VALID [2018-11-23 11:45:45,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {217#false} assume 0bv32 == ~cond; {217#false} is VALID [2018-11-23 11:45:45,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 11:45:45,885 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-23 11:45:45,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:45:45,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:45:45,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:45:45,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:45:45,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:45,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:45:45,950 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-23 11:45:45,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:45:45,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:45:45,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:45:45,951 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 11:45:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:46,421 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2018-11-23 11:45:46,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:45:46,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:45:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:45:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 11:45:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:45:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 11:45:46,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 11:45:46,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:46,553 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:45:46,553 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:45:46,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-23 11:45:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:45:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 11:45:46,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:46,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 11:45:46,584 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 11:45:46,584 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 11:45:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:46,588 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:45:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:45:46,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:46,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:46,590 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 11:45:46,590 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 11:45:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:46,594 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:45:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:45:46,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:46,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:46,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:46,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:45:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 11:45:46,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2018-11-23 11:45:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:46,598 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 11:45:46,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:45:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 11:45:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:45:46,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:46,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:46,600 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:46,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1690331484, now seen corresponding path program 1 times [2018-11-23 11:45:46,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:46,601 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-23 11:45:46,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:46,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:46,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-23 11:45:46,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} ~last~0 := 0bv32; {429#true} is VALID [2018-11-23 11:45:46,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-23 11:45:46,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #65#return; {429#true} is VALID [2018-11-23 11:45:46,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret2 := main(); {429#true} is VALID [2018-11-23 11:45:46,739 INFO L256 TraceCheckUtils]: 5: Hoare triple {429#true} call #t~ret0 := nondet(); {429#true} is VALID [2018-11-23 11:45:46,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {429#true} havoc ~x~0;#res := ~x~0; {429#true} is VALID [2018-11-23 11:45:46,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-23 11:45:46,740 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {429#true} {429#true} #69#return; {429#true} is VALID [2018-11-23 11:45:46,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {429#true} is VALID [2018-11-23 11:45:46,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {429#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {464#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:46,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {464#(= main_~c~0 (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {430#false} is VALID [2018-11-23 11:45:46,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {430#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {430#false} is VALID [2018-11-23 11:45:46,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {430#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {430#false} is VALID [2018-11-23 11:45:46,743 INFO L256 TraceCheckUtils]: 14: Hoare triple {430#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {430#false} is VALID [2018-11-23 11:45:46,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {430#false} ~cond := #in~cond; {430#false} is VALID [2018-11-23 11:45:46,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {430#false} assume 0bv32 == ~cond; {430#false} is VALID [2018-11-23 11:45:46,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-23 11:45:46,746 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-23 11:45:46,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:45:46,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:45:46,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:45:46,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:45:46,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:46,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:45:46,786 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-23 11:45:46,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:45:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:45:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:45:46,787 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2018-11-23 11:45:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:46,952 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-11-23 11:45:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:45:46,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:45:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:45:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 11:45:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:45:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 11:45:46,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-23 11:45:47,097 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-23 11:45:47,099 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:45:47,099 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:45:47,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-23 11:45:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:45:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-23 11:45:47,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:47,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2018-11-23 11:45:47,136 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2018-11-23 11:45:47,136 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2018-11-23 11:45:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:47,139 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 11:45:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:45:47,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:47,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:47,140 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2018-11-23 11:45:47,141 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2018-11-23 11:45:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:47,143 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 11:45:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:45:47,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:47,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:47,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:47,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:45:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-23 11:45:47,147 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2018-11-23 11:45:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:47,147 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 11:45:47,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:45:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 11:45:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:45:47,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:47,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:47,149 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:47,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash -479721733, now seen corresponding path program 1 times [2018-11-23 11:45:47,150 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:47,150 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-23 11:45:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:47,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:47,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 11:45:47,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} ~last~0 := 0bv32; {659#true} is VALID [2018-11-23 11:45:47,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 11:45:47,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #65#return; {659#true} is VALID [2018-11-23 11:45:47,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret2 := main(); {659#true} is VALID [2018-11-23 11:45:47,390 INFO L256 TraceCheckUtils]: 5: Hoare triple {659#true} call #t~ret0 := nondet(); {659#true} is VALID [2018-11-23 11:45:47,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#true} havoc ~x~0;#res := ~x~0; {659#true} is VALID [2018-11-23 11:45:47,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 11:45:47,391 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {659#true} {659#true} #69#return; {659#true} is VALID [2018-11-23 11:45:47,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {659#true} is VALID [2018-11-23 11:45:47,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {659#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {694#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:47,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {694#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {694#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:47,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {694#(= main_~c~0 (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {701#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:47,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {701#(= ~last~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {701#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:47,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {701#(= ~last~0 (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {701#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:47,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {701#(= ~last~0 (_ bv0 32))} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {711#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:47,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {660#false} is VALID [2018-11-23 11:45:47,399 INFO L256 TraceCheckUtils]: 17: Hoare triple {660#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {660#false} is VALID [2018-11-23 11:45:47,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2018-11-23 11:45:47,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {660#false} assume 0bv32 == ~cond; {660#false} is VALID [2018-11-23 11:45:47,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 11:45:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:47,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:47,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {660#false} assume !false; {660#false} is VALID [2018-11-23 11:45:47,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {660#false} assume 0bv32 == ~cond; {660#false} is VALID [2018-11-23 11:45:47,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2018-11-23 11:45:47,534 INFO L256 TraceCheckUtils]: 17: Hoare triple {660#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {660#false} is VALID [2018-11-23 11:45:47,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {739#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {660#false} is VALID [2018-11-23 11:45:47,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#true} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {739#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:45:47,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#true} assume !~bvslt32(~c~0, 200000bv32); {659#true} is VALID [2018-11-23 11:45:47,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {659#true} is VALID [2018-11-23 11:45:47,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {659#true} is VALID [2018-11-23 11:45:47,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#true} assume !!~bvslt32(~c~0, 200000bv32); {659#true} is VALID [2018-11-23 11:45:47,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {659#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {659#true} is VALID [2018-11-23 11:45:47,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {659#true} is VALID [2018-11-23 11:45:47,538 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {659#true} {659#true} #69#return; {659#true} is VALID [2018-11-23 11:45:47,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 11:45:47,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#true} havoc ~x~0;#res := ~x~0; {659#true} is VALID [2018-11-23 11:45:47,539 INFO L256 TraceCheckUtils]: 5: Hoare triple {659#true} call #t~ret0 := nondet(); {659#true} is VALID [2018-11-23 11:45:47,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret2 := main(); {659#true} is VALID [2018-11-23 11:45:47,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #65#return; {659#true} is VALID [2018-11-23 11:45:47,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2018-11-23 11:45:47,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {659#true} ~last~0 := 0bv32; {659#true} is VALID [2018-11-23 11:45:47,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2018-11-23 11:45:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:45:47,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:45:47,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-23 11:45:47,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:45:47,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:47,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:45:47,601 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-23 11:45:47,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:45:47,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:45:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:45:47,602 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 6 states. [2018-11-23 11:45:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:48,347 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2018-11-23 11:45:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:45:48,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:45:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:45:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2018-11-23 11:45:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:45:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2018-11-23 11:45:48,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 90 transitions. [2018-11-23 11:45:48,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:48,541 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:45:48,541 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:45:48,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:45:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:45:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-11-23 11:45:48,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:48,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 49 states. [2018-11-23 11:45:48,658 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 49 states. [2018-11-23 11:45:48,658 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 49 states. [2018-11-23 11:45:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:48,663 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 11:45:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 11:45:48,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:48,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:48,665 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 60 states. [2018-11-23 11:45:48,665 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 60 states. [2018-11-23 11:45:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:48,669 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 11:45:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 11:45:48,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:48,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:48,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:48,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:45:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 11:45:48,677 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 21 [2018-11-23 11:45:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:48,677 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 11:45:48,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:45:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 11:45:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:45:48,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:48,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:48,682 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:48,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash 259441981, now seen corresponding path program 1 times [2018-11-23 11:45:48,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:48,686 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-23 11:45:48,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:48,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:48,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 11:45:48,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {1092#true} ~last~0 := 0bv32; {1092#true} is VALID [2018-11-23 11:45:48,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:45:48,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #65#return; {1092#true} is VALID [2018-11-23 11:45:48,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret2 := main(); {1092#true} is VALID [2018-11-23 11:45:48,873 INFO L256 TraceCheckUtils]: 5: Hoare triple {1092#true} call #t~ret0 := nondet(); {1092#true} is VALID [2018-11-23 11:45:48,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {1092#true} havoc ~x~0;#res := ~x~0; {1092#true} is VALID [2018-11-23 11:45:48,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:45:48,873 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1092#true} {1092#true} #69#return; {1092#true} is VALID [2018-11-23 11:45:48,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {1092#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1092#true} is VALID [2018-11-23 11:45:48,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {1092#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1127#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:48,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {1127#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1127#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:48,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {1127#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {1127#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:48,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {1127#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1137#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:48,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {1137#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {1093#false} is VALID [2018-11-23 11:45:48,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1093#false} is VALID [2018-11-23 11:45:48,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {1093#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {1093#false} is VALID [2018-11-23 11:45:48,886 INFO L256 TraceCheckUtils]: 17: Hoare triple {1093#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {1093#false} is VALID [2018-11-23 11:45:48,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 11:45:48,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#false} assume 0bv32 == ~cond; {1093#false} is VALID [2018-11-23 11:45:48,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 11:45:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:48,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:48,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 11:45:48,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {1093#false} assume 0bv32 == ~cond; {1093#false} is VALID [2018-11-23 11:45:48,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 11:45:48,967 INFO L256 TraceCheckUtils]: 17: Hoare triple {1093#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {1093#false} is VALID [2018-11-23 11:45:48,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {1093#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {1093#false} is VALID [2018-11-23 11:45:48,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {1093#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1093#false} is VALID [2018-11-23 11:45:48,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {1177#(bvslt main_~c~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {1093#false} is VALID [2018-11-23 11:45:48,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {1181#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1177#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-23 11:45:48,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {1181#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {1181#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:48,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {1181#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {1181#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:48,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {1092#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1181#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:48,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {1092#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1092#true} is VALID [2018-11-23 11:45:48,987 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1092#true} {1092#true} #69#return; {1092#true} is VALID [2018-11-23 11:45:48,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:45:48,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {1092#true} havoc ~x~0;#res := ~x~0; {1092#true} is VALID [2018-11-23 11:45:48,988 INFO L256 TraceCheckUtils]: 5: Hoare triple {1092#true} call #t~ret0 := nondet(); {1092#true} is VALID [2018-11-23 11:45:48,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret2 := main(); {1092#true} is VALID [2018-11-23 11:45:48,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #65#return; {1092#true} is VALID [2018-11-23 11:45:48,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:45:48,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {1092#true} ~last~0 := 0bv32; {1092#true} is VALID [2018-11-23 11:45:48,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 11:45:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:48,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:45:48,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:45:48,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:45:48,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:48,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:45:49,028 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-23 11:45:49,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:45:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:45:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:45:49,029 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 6 states. [2018-11-23 11:45:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:49,606 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-11-23 11:45:49,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:45:49,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:45:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:45:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 11:45:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:45:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 11:45:49,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 11:45:49,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:49,734 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:45:49,734 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:45:49,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-23 11:45:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:45:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 11:45:49,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:49,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 11:45:49,819 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 11:45:49,819 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 11:45:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:49,823 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-23 11:45:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-23 11:45:49,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:49,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:49,825 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 11:45:49,825 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 11:45:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:49,829 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-23 11:45:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-23 11:45:49,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:49,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:49,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:49,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:45:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2018-11-23 11:45:49,835 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 21 [2018-11-23 11:45:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:49,835 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2018-11-23 11:45:49,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:45:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2018-11-23 11:45:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:45:49,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:49,837 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:49,837 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:49,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1536701416, now seen corresponding path program 1 times [2018-11-23 11:45:49,838 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:49,838 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-23 11:45:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:49,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:50,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1613#true} is VALID [2018-11-23 11:45:50,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {1613#true} ~last~0 := 0bv32; {1613#true} is VALID [2018-11-23 11:45:50,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2018-11-23 11:45:50,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #65#return; {1613#true} is VALID [2018-11-23 11:45:50,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret2 := main(); {1613#true} is VALID [2018-11-23 11:45:50,083 INFO L256 TraceCheckUtils]: 5: Hoare triple {1613#true} call #t~ret0 := nondet(); {1613#true} is VALID [2018-11-23 11:45:50,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {1613#true} havoc ~x~0;#res := ~x~0; {1613#true} is VALID [2018-11-23 11:45:50,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {1613#true} assume true; {1613#true} is VALID [2018-11-23 11:45:50,084 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1613#true} {1613#true} #69#return; {1613#true} is VALID [2018-11-23 11:45:50,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {1613#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1613#true} is VALID [2018-11-23 11:45:50,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {1613#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1648#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {1648#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1648#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {1648#(= main_~c~0 (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {1655#(= ~last~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,106 INFO L273 TraceCheckUtils]: 14: Hoare triple {1655#(= ~last~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {1655#(= ~last~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {1655#(= ~last~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {1655#(= ~last~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {1655#(= ~last~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {1655#(= ~last~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {1655#(= ~last~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1655#(= ~last~0 (_ bv0 32))} is VALID [2018-11-23 11:45:50,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {1655#(= ~last~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {1683#(and (= ~last~0 (_ bv0 32)) (not (= main_~c~0 ~last~0)))} is VALID [2018-11-23 11:45:50,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {1683#(and (= ~last~0 (_ bv0 32)) (not (= main_~c~0 ~last~0)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1687#(and (not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:50,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#(and (not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0)) (= ~last~0 (_ bv0 32)))} assume !~bvslt32(~c~0, 200000bv32); {1687#(and (not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:50,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#(and (not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0)) (= ~last~0 (_ bv0 32)))} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {1614#false} is VALID [2018-11-23 11:45:50,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {1614#false} is VALID [2018-11-23 11:45:50,113 INFO L256 TraceCheckUtils]: 26: Hoare triple {1614#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {1614#false} is VALID [2018-11-23 11:45:50,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2018-11-23 11:45:50,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {1614#false} assume 0bv32 == ~cond; {1614#false} is VALID [2018-11-23 11:45:50,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2018-11-23 11:45:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:45:50,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:50,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {1614#false} assume !false; {1614#false} is VALID [2018-11-23 11:45:50,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {1614#false} assume 0bv32 == ~cond; {1614#false} is VALID [2018-11-23 11:45:50,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {1614#false} ~cond := #in~cond; {1614#false} is VALID [2018-11-23 11:45:50,307 INFO L256 TraceCheckUtils]: 26: Hoare triple {1614#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {1614#false} is VALID [2018-11-23 11:45:50,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {1614#false} is VALID [2018-11-23 11:45:50,308 INFO L273 TraceCheckUtils]: 24: Hoare triple {1724#(not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {1614#false} is VALID [2018-11-23 11:45:50,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {1724#(not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume !~bvslt32(~c~0, 200000bv32); {1724#(not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:45:50,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {1731#(not (= main_~c~0 ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1724#(not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:45:50,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {1613#true} assume !(~c~0 == ~last~0); {1731#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:45:50,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {1613#true} assume !!~bvslt32(~c~0, 200000bv32); {1613#true} is VALID [2018-11-23 11:45:50,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {1613#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1613#true} is VALID [2018-11-23 11:45:50,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {1613#true} assume !(~c~0 == ~last~0); {1613#true} is VALID [2018-11-23 11:45:50,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {1613#true} assume !!~bvslt32(~c~0, 200000bv32); {1613#true} is VALID [2018-11-23 11:45:50,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {1613#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1613#true} is VALID [2018-11-23 11:45:50,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {1613#true} assume !(~c~0 == ~last~0); {1613#true} is VALID [2018-11-23 11:45:50,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {1613#true} assume !!~bvslt32(~c~0, 200000bv32); {1613#true} is VALID [2018-11-23 11:45:50,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {1613#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1613#true} is VALID [2018-11-23 11:45:50,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {1613#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {1613#true} is VALID [2018-11-23 11:45:50,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {1613#true} assume !!~bvslt32(~c~0, 200000bv32); {1613#true} is VALID [2018-11-23 11:45:50,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {1613#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1613#true} is VALID [2018-11-23 11:45:50,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {1613#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1613#true} is VALID [2018-11-23 11:45:50,326 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1613#true} {1613#true} #69#return; {1613#true} is VALID [2018-11-23 11:45:50,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {1613#true} assume true; {1613#true} is VALID [2018-11-23 11:45:50,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {1613#true} havoc ~x~0;#res := ~x~0; {1613#true} is VALID [2018-11-23 11:45:50,326 INFO L256 TraceCheckUtils]: 5: Hoare triple {1613#true} call #t~ret0 := nondet(); {1613#true} is VALID [2018-11-23 11:45:50,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {1613#true} call #t~ret2 := main(); {1613#true} is VALID [2018-11-23 11:45:50,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1613#true} {1613#true} #65#return; {1613#true} is VALID [2018-11-23 11:45:50,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {1613#true} assume true; {1613#true} is VALID [2018-11-23 11:45:50,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {1613#true} ~last~0 := 0bv32; {1613#true} is VALID [2018-11-23 11:45:50,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {1613#true} call ULTIMATE.init(); {1613#true} is VALID [2018-11-23 11:45:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 11:45:50,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:45:50,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 11:45:50,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 11:45:50,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:50,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:45:50,380 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-23 11:45:50,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:45:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:45:50,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:45:50,382 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 8 states. [2018-11-23 11:45:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:51,252 INFO L93 Difference]: Finished difference Result 146 states and 181 transitions. [2018-11-23 11:45:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:45:51,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 11:45:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:45:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 11:45:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:45:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 11:45:51,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-23 11:45:51,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:51,439 INFO L225 Difference]: With dead ends: 146 [2018-11-23 11:45:51,440 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 11:45:51,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:45:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 11:45:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-11-23 11:45:51,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:51,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 73 states. [2018-11-23 11:45:51,553 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 73 states. [2018-11-23 11:45:51,553 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 73 states. [2018-11-23 11:45:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:51,562 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-23 11:45:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-23 11:45:51,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:51,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:51,564 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 86 states. [2018-11-23 11:45:51,564 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 86 states. [2018-11-23 11:45:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:51,568 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-23 11:45:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-23 11:45:51,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:51,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:51,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:51,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 11:45:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2018-11-23 11:45:51,572 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 30 [2018-11-23 11:45:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:51,573 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2018-11-23 11:45:51,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:45:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2018-11-23 11:45:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:45:51,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:51,574 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:51,574 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:51,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1593959718, now seen corresponding path program 1 times [2018-11-23 11:45:51,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:51,575 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-23 11:45:51,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:45:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:51,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:51,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {2281#true} call ULTIMATE.init(); {2281#true} is VALID [2018-11-23 11:45:51,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {2281#true} ~last~0 := 0bv32; {2281#true} is VALID [2018-11-23 11:45:51,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 11:45:51,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} #65#return; {2281#true} is VALID [2018-11-23 11:45:51,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {2281#true} call #t~ret2 := main(); {2281#true} is VALID [2018-11-23 11:45:51,825 INFO L256 TraceCheckUtils]: 5: Hoare triple {2281#true} call #t~ret0 := nondet(); {2281#true} is VALID [2018-11-23 11:45:51,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {2281#true} havoc ~x~0;#res := ~x~0; {2281#true} is VALID [2018-11-23 11:45:51,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 11:45:51,826 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {2281#true} {2281#true} #69#return; {2281#true} is VALID [2018-11-23 11:45:51,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {2281#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {2281#true} is VALID [2018-11-23 11:45:51,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {2281#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {2316#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:51,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {2316#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {2316#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:51,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {2316#(= main_~c~0 (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {2316#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:51,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {2316#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2326#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {2326#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {2326#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {2326#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {2326#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2336#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {2336#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {2336#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {2336#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {2336#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {2336#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2346#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {2346#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {2346#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {2346#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {2346#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {2346#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2356#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:51,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {2356#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {2282#false} is VALID [2018-11-23 11:45:51,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {2282#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2282#false} is VALID [2018-11-23 11:45:51,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {2282#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {2282#false} is VALID [2018-11-23 11:45:51,849 INFO L256 TraceCheckUtils]: 26: Hoare triple {2282#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {2282#false} is VALID [2018-11-23 11:45:51,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {2282#false} ~cond := #in~cond; {2282#false} is VALID [2018-11-23 11:45:51,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {2282#false} assume 0bv32 == ~cond; {2282#false} is VALID [2018-11-23 11:45:51,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {2282#false} assume !false; {2282#false} is VALID [2018-11-23 11:45:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:51,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:52,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {2282#false} assume !false; {2282#false} is VALID [2018-11-23 11:45:52,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {2282#false} assume 0bv32 == ~cond; {2282#false} is VALID [2018-11-23 11:45:52,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {2282#false} ~cond := #in~cond; {2282#false} is VALID [2018-11-23 11:45:52,095 INFO L256 TraceCheckUtils]: 26: Hoare triple {2282#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {2282#false} is VALID [2018-11-23 11:45:52,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {2282#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {2282#false} is VALID [2018-11-23 11:45:52,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {2282#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2282#false} is VALID [2018-11-23 11:45:52,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {2396#(bvslt main_~c~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {2282#false} is VALID [2018-11-23 11:45:52,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {2400#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2396#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-23 11:45:52,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {2400#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {2400#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {2400#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {2400#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {2410#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2400#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {2410#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {2410#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {2410#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {2410#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {2420#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2410#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {2420#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {2420#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {2420#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {2420#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {2430#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2420#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {2430#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {2430#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {2430#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {2430#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {2281#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {2430#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-23 11:45:52,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {2281#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {2281#true} is VALID [2018-11-23 11:45:52,125 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {2281#true} {2281#true} #69#return; {2281#true} is VALID [2018-11-23 11:45:52,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 11:45:52,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {2281#true} havoc ~x~0;#res := ~x~0; {2281#true} is VALID [2018-11-23 11:45:52,126 INFO L256 TraceCheckUtils]: 5: Hoare triple {2281#true} call #t~ret0 := nondet(); {2281#true} is VALID [2018-11-23 11:45:52,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {2281#true} call #t~ret2 := main(); {2281#true} is VALID [2018-11-23 11:45:52,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} #65#return; {2281#true} is VALID [2018-11-23 11:45:52,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 11:45:52,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {2281#true} ~last~0 := 0bv32; {2281#true} is VALID [2018-11-23 11:45:52,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {2281#true} call ULTIMATE.init(); {2281#true} is VALID [2018-11-23 11:45:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:52,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:45:52,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:45:52,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 11:45:52,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:52,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:45:52,264 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-23 11:45:52,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:45:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:45:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:45:52,265 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 12 states. [2018-11-23 11:45:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:53,673 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2018-11-23 11:45:53,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:45:53,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 11:45:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:45:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 11:45:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:45:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 11:45:53,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-23 11:45:53,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:53,808 INFO L225 Difference]: With dead ends: 234 [2018-11-23 11:45:53,808 INFO L226 Difference]: Without dead ends: 171 [2018-11-23 11:45:53,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:45:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-23 11:45:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 156. [2018-11-23 11:45:54,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:54,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 156 states. [2018-11-23 11:45:54,041 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 156 states. [2018-11-23 11:45:54,041 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 156 states. [2018-11-23 11:45:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:54,047 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2018-11-23 11:45:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 204 transitions. [2018-11-23 11:45:54,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:54,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:54,048 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 171 states. [2018-11-23 11:45:54,048 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 171 states. [2018-11-23 11:45:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:54,054 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2018-11-23 11:45:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 204 transitions. [2018-11-23 11:45:54,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:54,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:54,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:54,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:45:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2018-11-23 11:45:54,062 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 30 [2018-11-23 11:45:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:54,063 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2018-11-23 11:45:54,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:45:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2018-11-23 11:45:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:45:54,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:54,064 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:54,065 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:54,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:54,065 INFO L82 PathProgramCache]: Analyzing trace with hash 202765062, now seen corresponding path program 2 times [2018-11-23 11:45:54,066 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:54,066 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-23 11:45:54,088 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:45:54,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:45:54,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:45:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:54,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:54,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {3352#true} call ULTIMATE.init(); {3352#true} is VALID [2018-11-23 11:45:54,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {3352#true} ~last~0 := 0bv32; {3352#true} is VALID [2018-11-23 11:45:54,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-23 11:45:54,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3352#true} {3352#true} #65#return; {3352#true} is VALID [2018-11-23 11:45:54,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {3352#true} call #t~ret2 := main(); {3352#true} is VALID [2018-11-23 11:45:54,286 INFO L256 TraceCheckUtils]: 5: Hoare triple {3352#true} call #t~ret0 := nondet(); {3352#true} is VALID [2018-11-23 11:45:54,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {3352#true} havoc ~x~0;#res := ~x~0; {3352#true} is VALID [2018-11-23 11:45:54,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-23 11:45:54,287 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3352#true} {3352#true} #69#return; {3352#true} is VALID [2018-11-23 11:45:54,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {3352#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {3352#true} is VALID [2018-11-23 11:45:54,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {3352#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {3387#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:54,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {3387#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3387#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:45:54,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {3387#(= main_~c~0 (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3394#(and (= main_~c~0 (_ bv0 32)) (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:45:54,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {3394#(and (= main_~c~0 (_ bv0 32)) (= main_~c~0 ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3398#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:54,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {3398#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {3398#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:54,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {3398#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {3398#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:54,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {3398#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3408#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:54,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {3408#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {3408#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:54,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {3408#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {3408#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:54,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {3408#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3418#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:54,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {3418#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {3418#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:54,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {3418#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~last~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3353#false} is VALID [2018-11-23 11:45:54,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3353#false} is VALID [2018-11-23 11:45:54,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,303 INFO L273 TraceCheckUtils]: 36: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,303 INFO L273 TraceCheckUtils]: 37: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,304 INFO L273 TraceCheckUtils]: 38: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,304 INFO L273 TraceCheckUtils]: 39: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,304 INFO L273 TraceCheckUtils]: 40: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,304 INFO L273 TraceCheckUtils]: 41: Hoare triple {3353#false} assume !~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,304 INFO L273 TraceCheckUtils]: 42: Hoare triple {3353#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {3353#false} is VALID [2018-11-23 11:45:54,304 INFO L273 TraceCheckUtils]: 43: Hoare triple {3353#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {3353#false} is VALID [2018-11-23 11:45:54,305 INFO L256 TraceCheckUtils]: 44: Hoare triple {3353#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {3353#false} is VALID [2018-11-23 11:45:54,305 INFO L273 TraceCheckUtils]: 45: Hoare triple {3353#false} ~cond := #in~cond; {3353#false} is VALID [2018-11-23 11:45:54,305 INFO L273 TraceCheckUtils]: 46: Hoare triple {3353#false} assume 0bv32 == ~cond; {3353#false} is VALID [2018-11-23 11:45:54,305 INFO L273 TraceCheckUtils]: 47: Hoare triple {3353#false} assume !false; {3353#false} is VALID [2018-11-23 11:45:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 11:45:54,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:45:54,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {3353#false} assume !false; {3353#false} is VALID [2018-11-23 11:45:54,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {3353#false} assume 0bv32 == ~cond; {3353#false} is VALID [2018-11-23 11:45:54,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {3353#false} ~cond := #in~cond; {3353#false} is VALID [2018-11-23 11:45:54,602 INFO L256 TraceCheckUtils]: 44: Hoare triple {3353#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {3353#false} is VALID [2018-11-23 11:45:54,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {3353#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {3353#false} is VALID [2018-11-23 11:45:54,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {3353#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {3353#false} is VALID [2018-11-23 11:45:54,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {3353#false} assume !~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,603 INFO L273 TraceCheckUtils]: 39: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,605 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3353#false} is VALID [2018-11-23 11:45:54,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {3353#false} assume !(~c~0 == ~last~0); {3353#false} is VALID [2018-11-23 11:45:54,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {3353#false} assume !!~bvslt32(~c~0, 200000bv32); {3353#false} is VALID [2018-11-23 11:45:54,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {3353#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3353#false} is VALID [2018-11-23 11:45:54,614 INFO L273 TraceCheckUtils]: 21: Hoare triple {3581#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3353#false} is VALID [2018-11-23 11:45:54,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {3581#(not (= main_~c~0 ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {3581#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:45:54,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {3588#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3581#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:45:54,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {3588#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !(~c~0 == ~last~0); {3588#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:45:54,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {3588#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {3588#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:45:54,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {3598#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3588#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:45:54,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {3598#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} assume !(~c~0 == ~last~0); {3598#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} is VALID [2018-11-23 11:45:54,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {3598#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {3598#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} is VALID [2018-11-23 11:45:54,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {3608#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3598#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} is VALID [2018-11-23 11:45:54,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {3352#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3608#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:45:54,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {3352#true} assume !!~bvslt32(~c~0, 200000bv32); {3352#true} is VALID [2018-11-23 11:45:54,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {3352#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {3352#true} is VALID [2018-11-23 11:45:54,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {3352#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {3352#true} is VALID [2018-11-23 11:45:54,682 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3352#true} {3352#true} #69#return; {3352#true} is VALID [2018-11-23 11:45:54,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-23 11:45:54,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {3352#true} havoc ~x~0;#res := ~x~0; {3352#true} is VALID [2018-11-23 11:45:54,683 INFO L256 TraceCheckUtils]: 5: Hoare triple {3352#true} call #t~ret0 := nondet(); {3352#true} is VALID [2018-11-23 11:45:54,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {3352#true} call #t~ret2 := main(); {3352#true} is VALID [2018-11-23 11:45:54,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3352#true} {3352#true} #65#return; {3352#true} is VALID [2018-11-23 11:45:54,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-23 11:45:54,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {3352#true} ~last~0 := 0bv32; {3352#true} is VALID [2018-11-23 11:45:54,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {3352#true} call ULTIMATE.init(); {3352#true} is VALID [2018-11-23 11:45:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 79 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 11:45:54,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:45:54,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 11:45:54,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-23 11:45:54,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:54,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:45:54,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:54,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:45:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:45:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:45:54,797 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand 11 states. [2018-11-23 11:45:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:56,888 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2018-11-23 11:45:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:45:56,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-23 11:45:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:45:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:45:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 11:45:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:45:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 11:45:56,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 104 transitions. [2018-11-23 11:45:57,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:57,390 INFO L225 Difference]: With dead ends: 359 [2018-11-23 11:45:57,390 INFO L226 Difference]: Without dead ends: 213 [2018-11-23 11:45:57,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:45:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-23 11:45:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2018-11-23 11:45:57,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:45:57,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 188 states. [2018-11-23 11:45:57,641 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 188 states. [2018-11-23 11:45:57,641 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 188 states. [2018-11-23 11:45:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:57,650 INFO L93 Difference]: Finished difference Result 213 states and 248 transitions. [2018-11-23 11:45:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 248 transitions. [2018-11-23 11:45:57,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:57,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:57,651 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 213 states. [2018-11-23 11:45:57,651 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 213 states. [2018-11-23 11:45:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:45:57,659 INFO L93 Difference]: Finished difference Result 213 states and 248 transitions. [2018-11-23 11:45:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 248 transitions. [2018-11-23 11:45:57,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:45:57,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:45:57,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:45:57,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:45:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-23 11:45:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2018-11-23 11:45:57,667 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 48 [2018-11-23 11:45:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:45:57,668 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2018-11-23 11:45:57,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:45:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-11-23 11:45:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:45:57,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:45:57,669 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:45:57,670 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:45:57,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:45:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -126317048, now seen corresponding path program 3 times [2018-11-23 11:45:57,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:45:57,670 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-23 11:45:57,698 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:45:57,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:45:57,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:45:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:45:57,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:45:58,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {4833#true} call ULTIMATE.init(); {4833#true} is VALID [2018-11-23 11:45:58,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {4833#true} ~last~0 := 0bv32; {4833#true} is VALID [2018-11-23 11:45:58,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {4833#true} assume true; {4833#true} is VALID [2018-11-23 11:45:58,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4833#true} {4833#true} #65#return; {4833#true} is VALID [2018-11-23 11:45:58,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {4833#true} call #t~ret2 := main(); {4833#true} is VALID [2018-11-23 11:45:58,518 INFO L256 TraceCheckUtils]: 5: Hoare triple {4833#true} call #t~ret0 := nondet(); {4833#true} is VALID [2018-11-23 11:45:58,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {4833#true} havoc ~x~0;#res := ~x~0; {4833#true} is VALID [2018-11-23 11:45:58,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {4833#true} assume true; {4833#true} is VALID [2018-11-23 11:45:58,518 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {4833#true} {4833#true} #69#return; {4833#true} is VALID [2018-11-23 11:45:58,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {4833#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {4865#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {4953#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {4953#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {4953#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:45:58,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {4953#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4960#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-23 11:45:58,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {4960#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume !~bvslt32(~c~0, 200000bv32); {4964#(and (= main_~b~0 (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-23 11:45:58,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {4964#(and (= main_~b~0 (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {4968#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:58,597 INFO L273 TraceCheckUtils]: 43: Hoare triple {4968#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {4968#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:45:58,602 INFO L256 TraceCheckUtils]: 44: Hoare triple {4968#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {4975#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:58,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {4975#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4979#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:45:58,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {4979#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4834#false} is VALID [2018-11-23 11:45:58,603 INFO L273 TraceCheckUtils]: 47: Hoare triple {4834#false} assume !false; {4834#false} is VALID [2018-11-23 11:45:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-23 11:45:58,609 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:45:58,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:45:58,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:45:58,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-11-23 11:45:58,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:58,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:45:58,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:45:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:45:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:45:58,667 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 9 states. [2018-11-23 11:46:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:00,387 INFO L93 Difference]: Finished difference Result 365 states and 421 transitions. [2018-11-23 11:46:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:46:00,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-11-23 11:46:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:46:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:46:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 11:46:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:46:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 11:46:00,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-23 11:46:00,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:00,483 INFO L225 Difference]: With dead ends: 365 [2018-11-23 11:46:00,483 INFO L226 Difference]: Without dead ends: 363 [2018-11-23 11:46:00,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:46:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-23 11:46:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-11-23 11:46:02,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:46:02,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand 361 states. [2018-11-23 11:46:02,185 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand 361 states. [2018-11-23 11:46:02,185 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 361 states. [2018-11-23 11:46:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:02,200 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2018-11-23 11:46:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 418 transitions. [2018-11-23 11:46:02,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:02,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:02,201 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand 363 states. [2018-11-23 11:46:02,201 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 363 states. [2018-11-23 11:46:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:02,214 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2018-11-23 11:46:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 418 transitions. [2018-11-23 11:46:02,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:02,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:02,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:46:02,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:46:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-23 11:46:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 416 transitions. [2018-11-23 11:46:02,227 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 416 transitions. Word has length 48 [2018-11-23 11:46:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:46:02,227 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 416 transitions. [2018-11-23 11:46:02,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:46:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 416 transitions. [2018-11-23 11:46:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:46:02,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:46:02,229 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:46:02,229 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:46:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:46:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1350150336, now seen corresponding path program 2 times [2018-11-23 11:46:02,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:46:02,230 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-23 11:46:02,251 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:46:02,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:46:02,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:46:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:02,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:46:02,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2018-11-23 11:46:02,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {6693#true} ~last~0 := 0bv32; {6693#true} is VALID [2018-11-23 11:46:02,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {6693#true} assume true; {6693#true} is VALID [2018-11-23 11:46:02,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6693#true} {6693#true} #65#return; {6693#true} is VALID [2018-11-23 11:46:02,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {6693#true} call #t~ret2 := main(); {6693#true} is VALID [2018-11-23 11:46:02,556 INFO L256 TraceCheckUtils]: 5: Hoare triple {6693#true} call #t~ret0 := nondet(); {6693#true} is VALID [2018-11-23 11:46:02,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {6693#true} havoc ~x~0;#res := ~x~0; {6693#true} is VALID [2018-11-23 11:46:02,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {6693#true} assume true; {6693#true} is VALID [2018-11-23 11:46:02,557 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {6693#true} {6693#true} #69#return; {6693#true} is VALID [2018-11-23 11:46:02,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {6693#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {6693#true} is VALID [2018-11-23 11:46:02,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {6728#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:02,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {6728#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {6728#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:02,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {6728#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {6728#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:02,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {6728#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6738#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:02,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {6738#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {6738#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:02,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {6738#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {6745#(and (= main_~c~0 ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:46:02,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {6745#(and (= main_~c~0 ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6749#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {6749#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {6749#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {6749#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !(~c~0 == ~last~0); {6749#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {6749#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= (_ bv1 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6759#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {6759#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {6759#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {6759#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !(~c~0 == ~last~0); {6759#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {6759#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= (_ bv1 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6769#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:02,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {6769#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {6769#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:02,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {6769#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !(~c~0 == ~last~0); {6769#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:02,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {6769#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6779#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {6779#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {6779#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:02,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {6779#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {6694#false} is VALID [2018-11-23 11:46:02,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {6694#false} assume !(~c~0 == ~last~0); {6694#false} is VALID [2018-11-23 11:46:02,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,581 INFO L273 TraceCheckUtils]: 33: Hoare triple {6694#false} assume !(~c~0 == ~last~0); {6694#false} is VALID [2018-11-23 11:46:02,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {6694#false} assume !(~c~0 == ~last~0); {6694#false} is VALID [2018-11-23 11:46:02,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {6694#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {6694#false} is VALID [2018-11-23 11:46:02,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,583 INFO L273 TraceCheckUtils]: 41: Hoare triple {6694#false} assume !~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,583 INFO L273 TraceCheckUtils]: 42: Hoare triple {6694#false} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {6694#false} is VALID [2018-11-23 11:46:02,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {6694#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {6694#false} is VALID [2018-11-23 11:46:02,584 INFO L256 TraceCheckUtils]: 44: Hoare triple {6694#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {6694#false} is VALID [2018-11-23 11:46:02,584 INFO L273 TraceCheckUtils]: 45: Hoare triple {6694#false} ~cond := #in~cond; {6694#false} is VALID [2018-11-23 11:46:02,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {6694#false} assume 0bv32 == ~cond; {6694#false} is VALID [2018-11-23 11:46:02,584 INFO L273 TraceCheckUtils]: 47: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2018-11-23 11:46:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 79 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 11:46:02,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:46:02,808 INFO L273 TraceCheckUtils]: 47: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2018-11-23 11:46:02,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {6694#false} assume 0bv32 == ~cond; {6694#false} is VALID [2018-11-23 11:46:02,808 INFO L273 TraceCheckUtils]: 45: Hoare triple {6694#false} ~cond := #in~cond; {6694#false} is VALID [2018-11-23 11:46:02,809 INFO L256 TraceCheckUtils]: 44: Hoare triple {6694#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {6694#false} is VALID [2018-11-23 11:46:02,809 INFO L273 TraceCheckUtils]: 43: Hoare triple {6694#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {6694#false} is VALID [2018-11-23 11:46:02,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {6694#false} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {6694#false} is VALID [2018-11-23 11:46:02,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {6694#false} assume !~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {6694#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {6694#false} is VALID [2018-11-23 11:46:02,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,810 INFO L273 TraceCheckUtils]: 37: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {6694#false} assume !(~c~0 == ~last~0); {6694#false} is VALID [2018-11-23 11:46:02,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {6694#false} assume !(~c~0 == ~last~0); {6694#false} is VALID [2018-11-23 11:46:02,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {6694#false} assume !(~c~0 == ~last~0); {6694#false} is VALID [2018-11-23 11:46:02,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {6694#false} assume !!~bvslt32(~c~0, 200000bv32); {6694#false} is VALID [2018-11-23 11:46:02,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {6694#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6694#false} is VALID [2018-11-23 11:46:02,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {6906#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {6694#false} is VALID [2018-11-23 11:46:02,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {6906#(not (= main_~c~0 ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {6906#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:02,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {6913#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6906#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:02,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {6913#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !(~c~0 == ~last~0); {6913#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:02,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {6913#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {6913#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:02,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {6923#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6913#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:02,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {6923#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} assume !(~c~0 == ~last~0); {6923#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:02,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {6923#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {6923#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:02,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {6933#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6923#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:02,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {6933#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} assume !(~c~0 == ~last~0); {6933#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} is VALID [2018-11-23 11:46:02,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {6933#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {6933#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} is VALID [2018-11-23 11:46:02,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {6943#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6933#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} is VALID [2018-11-23 11:46:02,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {6693#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {6943#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} is VALID [2018-11-23 11:46:02,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {6693#true} assume !!~bvslt32(~c~0, 200000bv32); {6693#true} is VALID [2018-11-23 11:46:02,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {6693#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6693#true} is VALID [2018-11-23 11:46:02,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {6693#true} assume !(~c~0 == ~last~0); {6693#true} is VALID [2018-11-23 11:46:02,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {6693#true} assume !!~bvslt32(~c~0, 200000bv32); {6693#true} is VALID [2018-11-23 11:46:02,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {6693#true} is VALID [2018-11-23 11:46:02,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {6693#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {6693#true} is VALID [2018-11-23 11:46:02,885 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {6693#true} {6693#true} #69#return; {6693#true} is VALID [2018-11-23 11:46:02,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {6693#true} assume true; {6693#true} is VALID [2018-11-23 11:46:02,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {6693#true} havoc ~x~0;#res := ~x~0; {6693#true} is VALID [2018-11-23 11:46:02,886 INFO L256 TraceCheckUtils]: 5: Hoare triple {6693#true} call #t~ret0 := nondet(); {6693#true} is VALID [2018-11-23 11:46:02,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {6693#true} call #t~ret2 := main(); {6693#true} is VALID [2018-11-23 11:46:02,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6693#true} {6693#true} #65#return; {6693#true} is VALID [2018-11-23 11:46:02,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {6693#true} assume true; {6693#true} is VALID [2018-11-23 11:46:02,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {6693#true} ~last~0 := 0bv32; {6693#true} is VALID [2018-11-23 11:46:02,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2018-11-23 11:46:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 99 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:46:02,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:46:02,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:46:02,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:46:02,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:46:02,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:46:03,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:03,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:46:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:46:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:46:03,070 INFO L87 Difference]: Start difference. First operand 361 states and 416 transitions. Second operand 14 states. [2018-11-23 11:46:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:07,033 INFO L93 Difference]: Finished difference Result 710 states and 842 transitions. [2018-11-23 11:46:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:46:07,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:46:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:46:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:46:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 123 transitions. [2018-11-23 11:46:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:46:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 123 transitions. [2018-11-23 11:46:07,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 123 transitions. [2018-11-23 11:46:07,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:07,952 INFO L225 Difference]: With dead ends: 710 [2018-11-23 11:46:07,952 INFO L226 Difference]: Without dead ends: 465 [2018-11-23 11:46:07,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:46:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-23 11:46:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 395. [2018-11-23 11:46:08,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:46:08,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states. Second operand 395 states. [2018-11-23 11:46:08,733 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand 395 states. [2018-11-23 11:46:08,733 INFO L87 Difference]: Start difference. First operand 465 states. Second operand 395 states. [2018-11-23 11:46:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:08,752 INFO L93 Difference]: Finished difference Result 465 states and 536 transitions. [2018-11-23 11:46:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 536 transitions. [2018-11-23 11:46:08,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:08,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:08,754 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand 465 states. [2018-11-23 11:46:08,754 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 465 states. [2018-11-23 11:46:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:08,772 INFO L93 Difference]: Finished difference Result 465 states and 536 transitions. [2018-11-23 11:46:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 536 transitions. [2018-11-23 11:46:08,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:08,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:08,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:46:08,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:46:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-11-23 11:46:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 450 transitions. [2018-11-23 11:46:08,788 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 450 transitions. Word has length 48 [2018-11-23 11:46:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:46:08,788 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 450 transitions. [2018-11-23 11:46:08,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:46:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 450 transitions. [2018-11-23 11:46:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:46:08,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:46:08,790 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:46:08,790 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:46:08,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:46:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1022467322, now seen corresponding path program 3 times [2018-11-23 11:46:08,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:46:08,791 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-23 11:46:08,822 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:46:08,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:46:08,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:46:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:08,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:46:09,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {9439#true} call ULTIMATE.init(); {9439#true} is VALID [2018-11-23 11:46:09,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {9439#true} ~last~0 := 0bv32; {9439#true} is VALID [2018-11-23 11:46:09,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {9439#true} assume true; {9439#true} is VALID [2018-11-23 11:46:09,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9439#true} {9439#true} #65#return; {9439#true} is VALID [2018-11-23 11:46:09,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {9439#true} call #t~ret2 := main(); {9439#true} is VALID [2018-11-23 11:46:09,878 INFO L256 TraceCheckUtils]: 5: Hoare triple {9439#true} call #t~ret0 := nondet(); {9439#true} is VALID [2018-11-23 11:46:09,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {9439#true} havoc ~x~0;#res := ~x~0; {9439#true} is VALID [2018-11-23 11:46:09,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {9439#true} assume true; {9439#true} is VALID [2018-11-23 11:46:09,878 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {9439#true} {9439#true} #69#return; {9439#true} is VALID [2018-11-23 11:46:09,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {9439#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,915 INFO L273 TraceCheckUtils]: 29: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,919 INFO L273 TraceCheckUtils]: 32: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,922 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {9471#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {9559#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:46:09,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {9559#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {9563#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)) (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:09,932 INFO L273 TraceCheckUtils]: 40: Hoare triple {9563#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)) (= main_~c~0 ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {9567#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-23 11:46:09,932 INFO L273 TraceCheckUtils]: 41: Hoare triple {9567#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume !~bvslt32(~c~0, 200000bv32); {9571#(and (= main_~b~0 (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-23 11:46:09,933 INFO L273 TraceCheckUtils]: 42: Hoare triple {9571#(and (= main_~b~0 (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume 0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {9575#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:46:09,935 INFO L273 TraceCheckUtils]: 43: Hoare triple {9575#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {9575#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:46:09,939 INFO L256 TraceCheckUtils]: 44: Hoare triple {9575#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {9582#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:09,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {9582#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {9586#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:09,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {9586#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {9440#false} is VALID [2018-11-23 11:46:09,940 INFO L273 TraceCheckUtils]: 47: Hoare triple {9440#false} assume !false; {9440#false} is VALID [2018-11-23 11:46:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-23 11:46:09,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:46:09,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:46:09,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:46:09,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-23 11:46:09,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:46:09,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:46:10,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:10,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:46:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:46:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:46:10,029 INFO L87 Difference]: Start difference. First operand 395 states and 450 transitions. Second operand 10 states. [2018-11-23 11:46:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:11,747 INFO L93 Difference]: Finished difference Result 408 states and 463 transitions. [2018-11-23 11:46:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:46:11,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-23 11:46:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:46:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:46:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-23 11:46:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:46:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-23 11:46:11,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2018-11-23 11:46:12,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:12,323 INFO L225 Difference]: With dead ends: 408 [2018-11-23 11:46:12,323 INFO L226 Difference]: Without dead ends: 406 [2018-11-23 11:46:12,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:46:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-23 11:46:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 395. [2018-11-23 11:46:13,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:46:13,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand 395 states. [2018-11-23 11:46:13,463 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand 395 states. [2018-11-23 11:46:13,463 INFO L87 Difference]: Start difference. First operand 406 states. Second operand 395 states. [2018-11-23 11:46:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:13,476 INFO L93 Difference]: Finished difference Result 406 states and 461 transitions. [2018-11-23 11:46:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 461 transitions. [2018-11-23 11:46:13,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:13,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:13,477 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand 406 states. [2018-11-23 11:46:13,478 INFO L87 Difference]: Start difference. First operand 395 states. Second operand 406 states. [2018-11-23 11:46:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:13,492 INFO L93 Difference]: Finished difference Result 406 states and 461 transitions. [2018-11-23 11:46:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 461 transitions. [2018-11-23 11:46:13,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:13,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:13,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:46:13,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:46:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-11-23 11:46:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 450 transitions. [2018-11-23 11:46:13,508 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 450 transitions. Word has length 48 [2018-11-23 11:46:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:46:13,508 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 450 transitions. [2018-11-23 11:46:13,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:46:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 450 transitions. [2018-11-23 11:46:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:46:13,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:46:13,509 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:46:13,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:46:13,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:46:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -286997692, now seen corresponding path program 1 times [2018-11-23 11:46:13,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:46:13,511 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-23 11:46:13,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:46:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:13,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:46:14,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11489#true} is VALID [2018-11-23 11:46:14,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {11489#true} ~last~0 := 0bv32; {11489#true} is VALID [2018-11-23 11:46:14,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2018-11-23 11:46:14,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #65#return; {11489#true} is VALID [2018-11-23 11:46:14,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret2 := main(); {11489#true} is VALID [2018-11-23 11:46:14,486 INFO L256 TraceCheckUtils]: 5: Hoare triple {11489#true} call #t~ret0 := nondet(); {11489#true} is VALID [2018-11-23 11:46:14,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {11489#true} havoc ~x~0;#res := ~x~0; {11489#true} is VALID [2018-11-23 11:46:14,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {11489#true} assume true; {11489#true} is VALID [2018-11-23 11:46:14,487 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {11489#true} {11489#true} #69#return; {11489#true} is VALID [2018-11-23 11:46:14,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {11489#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {11489#true} is VALID [2018-11-23 11:46:14,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {11489#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {11524#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:14,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {11524#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {11524#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:14,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {11524#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {11524#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:14,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {11524#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11534#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:14,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {11534#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {11534#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:14,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {11534#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {11534#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:14,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {11534#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:14,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {11544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {11544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:14,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {11544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {11551#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:14,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {11551#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~c~0 ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11555#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:46:14,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {11555#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11555#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:46:14,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {11555#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume !(~c~0 == ~last~0); {11555#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:46:14,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {11555#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11565#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} is VALID [2018-11-23 11:46:14,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {11565#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11565#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} is VALID [2018-11-23 11:46:14,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {11565#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} assume !(~c~0 == ~last~0); {11565#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} is VALID [2018-11-23 11:46:14,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {11565#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11575#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:14,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {11575#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {11575#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:14,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {11575#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !(~c~0 == ~last~0); {11575#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:14,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {11575#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11585#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {11585#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv2 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11585#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {11585#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv2 32) ~last~0))} assume !(~c~0 == ~last~0); {11585#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {11585#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv2 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11595#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:46:14,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {11595#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11595#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:46:14,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {11595#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} assume !(~c~0 == ~last~0); {11595#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:46:14,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {11595#(and (= (_ bv2 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11605#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {11605#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv2 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11605#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {11605#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv2 32) ~last~0))} assume !(~c~0 == ~last~0); {11605#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {11605#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv2 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11615#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {11615#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv2 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11615#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {11615#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv2 32) ~last~0))} assume !(~c~0 == ~last~0); {11615#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv2 32) ~last~0))} is VALID [2018-11-23 11:46:14,516 INFO L273 TraceCheckUtils]: 40: Hoare triple {11615#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv2 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11625#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:46:14,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {11625#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume !~bvslt32(~c~0, 200000bv32); {11625#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:46:14,518 INFO L273 TraceCheckUtils]: 42: Hoare triple {11625#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {11625#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:46:14,519 INFO L273 TraceCheckUtils]: 43: Hoare triple {11625#(and (= (_ bv2 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {11490#false} is VALID [2018-11-23 11:46:14,519 INFO L256 TraceCheckUtils]: 44: Hoare triple {11490#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {11490#false} is VALID [2018-11-23 11:46:14,519 INFO L273 TraceCheckUtils]: 45: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2018-11-23 11:46:14,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {11490#false} assume 0bv32 == ~cond; {11490#false} is VALID [2018-11-23 11:46:14,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2018-11-23 11:46:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:46:14,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:46:15,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {11490#false} assume !false; {11490#false} is VALID [2018-11-23 11:46:15,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {11490#false} assume 0bv32 == ~cond; {11490#false} is VALID [2018-11-23 11:46:15,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {11490#false} ~cond := #in~cond; {11490#false} is VALID [2018-11-23 11:46:15,238 INFO L256 TraceCheckUtils]: 44: Hoare triple {11490#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {11490#false} is VALID [2018-11-23 11:46:15,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {11659#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {11490#false} is VALID [2018-11-23 11:46:15,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {11659#(not (= main_~c~0 ~last~0))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {11659#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:15,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {11659#(not (= main_~c~0 ~last~0))} assume !~bvslt32(~c~0, 200000bv32); {11659#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:15,251 INFO L273 TraceCheckUtils]: 40: Hoare triple {11669#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11659#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:15,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {11669#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !(~c~0 == ~last~0); {11669#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:15,252 INFO L273 TraceCheckUtils]: 38: Hoare triple {11669#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11669#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:15,266 INFO L273 TraceCheckUtils]: 37: Hoare triple {11679#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11669#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:15,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {11679#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} assume !(~c~0 == ~last~0); {11679#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:15,266 INFO L273 TraceCheckUtils]: 35: Hoare triple {11679#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11679#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:15,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {11689#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11679#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:15,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {11689#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} assume !(~c~0 == ~last~0); {11689#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:46:15,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {11689#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11689#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:46:15,315 INFO L273 TraceCheckUtils]: 31: Hoare triple {11699#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11689#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:46:15,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {11699#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} assume !(~c~0 == ~last~0); {11699#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} is VALID [2018-11-23 11:46:15,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {11699#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {11699#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} is VALID [2018-11-23 11:46:15,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {11709#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11699#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} is VALID [2018-11-23 11:46:15,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {11709#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} assume !(~c~0 == ~last~0); {11709#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:46:15,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {11709#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11709#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:46:15,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {11719#(not (= (bvadd main_~c~0 (_ bv6 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11709#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:46:15,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {11719#(not (= (bvadd main_~c~0 (_ bv6 32)) ~last~0))} assume !(~c~0 == ~last~0); {11719#(not (= (bvadd main_~c~0 (_ bv6 32)) ~last~0))} is VALID [2018-11-23 11:46:15,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {11719#(not (= (bvadd main_~c~0 (_ bv6 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11719#(not (= (bvadd main_~c~0 (_ bv6 32)) ~last~0))} is VALID [2018-11-23 11:46:15,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {11729#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11719#(not (= (bvadd main_~c~0 (_ bv6 32)) ~last~0))} is VALID [2018-11-23 11:46:15,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {11729#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} assume !(~c~0 == ~last~0); {11729#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:46:15,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {11729#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {11729#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:46:15,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {11739#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11729#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:46:15,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {11489#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {11739#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:46:15,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {11489#true} assume !!~bvslt32(~c~0, 200000bv32); {11489#true} is VALID [2018-11-23 11:46:15,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {11489#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11489#true} is VALID [2018-11-23 11:46:15,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {11489#true} assume !(~c~0 == ~last~0); {11489#true} is VALID [2018-11-23 11:46:15,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {11489#true} assume !!~bvslt32(~c~0, 200000bv32); {11489#true} is VALID [2018-11-23 11:46:15,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {11489#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {11489#true} is VALID [2018-11-23 11:46:15,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {11489#true} assume !(~c~0 == ~last~0); {11489#true} is VALID [2018-11-23 11:46:15,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {11489#true} assume !!~bvslt32(~c~0, 200000bv32); {11489#true} is VALID [2018-11-23 11:46:15,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {11489#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {11489#true} is VALID [2018-11-23 11:46:15,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {11489#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {11489#true} is VALID [2018-11-23 11:46:15,415 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {11489#true} {11489#true} #69#return; {11489#true} is VALID [2018-11-23 11:46:15,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {11489#true} assume true; {11489#true} is VALID [2018-11-23 11:46:15,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {11489#true} havoc ~x~0;#res := ~x~0; {11489#true} is VALID [2018-11-23 11:46:15,416 INFO L256 TraceCheckUtils]: 5: Hoare triple {11489#true} call #t~ret0 := nondet(); {11489#true} is VALID [2018-11-23 11:46:15,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {11489#true} call #t~ret2 := main(); {11489#true} is VALID [2018-11-23 11:46:15,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11489#true} {11489#true} #65#return; {11489#true} is VALID [2018-11-23 11:46:15,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {11489#true} assume true; {11489#true} is VALID [2018-11-23 11:46:15,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {11489#true} ~last~0 := 0bv32; {11489#true} is VALID [2018-11-23 11:46:15,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {11489#true} call ULTIMATE.init(); {11489#true} is VALID [2018-11-23 11:46:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:46:15,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:46:15,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-11-23 11:46:15,421 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 11:46:15,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:46:15,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:46:15,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:15,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:46:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:46:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:46:15,663 INFO L87 Difference]: Start difference. First operand 395 states and 450 transitions. Second operand 23 states. [2018-11-23 11:46:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:28,833 INFO L93 Difference]: Finished difference Result 898 states and 1107 transitions. [2018-11-23 11:46:28,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:46:28,834 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 11:46:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:46:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:46:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 200 transitions. [2018-11-23 11:46:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:46:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 200 transitions. [2018-11-23 11:46:28,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 200 transitions. [2018-11-23 11:46:31,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:31,625 INFO L225 Difference]: With dead ends: 898 [2018-11-23 11:46:31,626 INFO L226 Difference]: Without dead ends: 649 [2018-11-23 11:46:31,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=388, Invalid=1172, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:46:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-23 11:46:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 491. [2018-11-23 11:46:32,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:46:32,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand 491 states. [2018-11-23 11:46:32,544 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand 491 states. [2018-11-23 11:46:32,544 INFO L87 Difference]: Start difference. First operand 649 states. Second operand 491 states. [2018-11-23 11:46:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:32,572 INFO L93 Difference]: Finished difference Result 649 states and 759 transitions. [2018-11-23 11:46:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 759 transitions. [2018-11-23 11:46:32,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:32,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:32,575 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 649 states. [2018-11-23 11:46:32,575 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 649 states. [2018-11-23 11:46:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:32,603 INFO L93 Difference]: Finished difference Result 649 states and 759 transitions. [2018-11-23 11:46:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 759 transitions. [2018-11-23 11:46:32,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:32,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:32,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:46:32,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:46:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-11-23 11:46:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 560 transitions. [2018-11-23 11:46:32,625 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 560 transitions. Word has length 48 [2018-11-23 11:46:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:46:32,625 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 560 transitions. [2018-11-23 11:46:32,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:46:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 560 transitions. [2018-11-23 11:46:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:46:32,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:46:32,627 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:46:32,627 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:46:32,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:46:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash -724433251, now seen corresponding path program 2 times [2018-11-23 11:46:32,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:46:32,628 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-23 11:46:32,657 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:46:32,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:46:32,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:46:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:32,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:46:33,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {15012#true} call ULTIMATE.init(); {15012#true} is VALID [2018-11-23 11:46:33,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {15012#true} ~last~0 := 0bv32; {15012#true} is VALID [2018-11-23 11:46:33,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {15012#true} assume true; {15012#true} is VALID [2018-11-23 11:46:33,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15012#true} {15012#true} #65#return; {15012#true} is VALID [2018-11-23 11:46:33,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {15012#true} call #t~ret2 := main(); {15012#true} is VALID [2018-11-23 11:46:33,130 INFO L256 TraceCheckUtils]: 5: Hoare triple {15012#true} call #t~ret0 := nondet(); {15012#true} is VALID [2018-11-23 11:46:33,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {15012#true} havoc ~x~0;#res := ~x~0; {15012#true} is VALID [2018-11-23 11:46:33,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {15012#true} assume true; {15012#true} is VALID [2018-11-23 11:46:33,131 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {15012#true} {15012#true} #69#return; {15012#true} is VALID [2018-11-23 11:46:33,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {15012#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {15012#true} is VALID [2018-11-23 11:46:33,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {15012#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {15047#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:33,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {15047#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {15047#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:33,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {15047#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {15047#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:33,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {15047#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15057#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:33,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {15057#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {15057#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:33,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {15057#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {15064#(and (= main_~c~0 ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:46:33,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {15064#(and (= main_~c~0 ~last~0) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15068#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:46:33,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {15068#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15068#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:46:33,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {15068#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume !(~c~0 == ~last~0); {15068#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-23 11:46:33,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {15068#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15078#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} is VALID [2018-11-23 11:46:33,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {15078#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15078#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} is VALID [2018-11-23 11:46:33,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {15078#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} assume !(~c~0 == ~last~0); {15078#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} is VALID [2018-11-23 11:46:33,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {15078#(and (= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15088#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {15088#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {15088#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {15088#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !(~c~0 == ~last~0); {15088#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {15088#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15098#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {15098#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15098#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {15098#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !(~c~0 == ~last~0); {15098#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {15098#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= (_ bv1 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15108#(and (= (_ bv1 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:46:33,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {15108#(and (= (_ bv1 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15108#(and (= (_ bv1 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:46:33,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {15108#(and (= (_ bv1 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} assume !(~c~0 == ~last~0); {15108#(and (= (_ bv1 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:46:33,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {15108#(and (= (_ bv1 32) ~last~0) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15118#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {15118#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15118#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {15118#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv1 32) ~last~0))} assume !(~c~0 == ~last~0); {15118#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {15118#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= (_ bv1 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15128#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {15128#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15128#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {15128#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !(~c~0 == ~last~0); {15128#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,208 INFO L273 TraceCheckUtils]: 37: Hoare triple {15128#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= (_ bv1 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15138#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,209 INFO L273 TraceCheckUtils]: 38: Hoare triple {15138#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {15138#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {15138#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume !(~c~0 == ~last~0); {15138#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,210 INFO L273 TraceCheckUtils]: 40: Hoare triple {15138#(and (= (_ bv1 32) ~last~0) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15148#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,210 INFO L273 TraceCheckUtils]: 41: Hoare triple {15148#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15148#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,210 INFO L273 TraceCheckUtils]: 42: Hoare triple {15148#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= (_ bv1 32) ~last~0))} assume !(~c~0 == ~last~0); {15148#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,211 INFO L273 TraceCheckUtils]: 43: Hoare triple {15148#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= (_ bv1 32) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15158#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {15158#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= (_ bv1 32) ~last~0))} assume !~bvslt32(~c~0, 200000bv32); {15158#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {15158#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= (_ bv1 32) ~last~0))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {15158#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= (_ bv1 32) ~last~0))} is VALID [2018-11-23 11:46:33,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {15158#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= (_ bv1 32) ~last~0))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {15013#false} is VALID [2018-11-23 11:46:33,213 INFO L256 TraceCheckUtils]: 47: Hoare triple {15013#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {15013#false} is VALID [2018-11-23 11:46:33,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {15013#false} ~cond := #in~cond; {15013#false} is VALID [2018-11-23 11:46:33,214 INFO L273 TraceCheckUtils]: 49: Hoare triple {15013#false} assume 0bv32 == ~cond; {15013#false} is VALID [2018-11-23 11:46:33,214 INFO L273 TraceCheckUtils]: 50: Hoare triple {15013#false} assume !false; {15013#false} is VALID [2018-11-23 11:46:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:46:33,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:46:33,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {15013#false} assume !false; {15013#false} is VALID [2018-11-23 11:46:33,829 INFO L273 TraceCheckUtils]: 49: Hoare triple {15013#false} assume 0bv32 == ~cond; {15013#false} is VALID [2018-11-23 11:46:33,829 INFO L273 TraceCheckUtils]: 48: Hoare triple {15013#false} ~cond := #in~cond; {15013#false} is VALID [2018-11-23 11:46:33,830 INFO L256 TraceCheckUtils]: 47: Hoare triple {15013#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {15013#false} is VALID [2018-11-23 11:46:33,830 INFO L273 TraceCheckUtils]: 46: Hoare triple {15192#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {15013#false} is VALID [2018-11-23 11:46:33,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {15192#(not (= main_~c~0 ~last~0))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {15192#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:33,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {15192#(not (= main_~c~0 ~last~0))} assume !~bvslt32(~c~0, 200000bv32); {15192#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:33,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {15202#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15192#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:33,843 INFO L273 TraceCheckUtils]: 42: Hoare triple {15202#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !(~c~0 == ~last~0); {15202#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:33,843 INFO L273 TraceCheckUtils]: 41: Hoare triple {15202#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15202#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:33,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {15212#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15202#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:46:33,865 INFO L273 TraceCheckUtils]: 39: Hoare triple {15212#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} assume !(~c~0 == ~last~0); {15212#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:33,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {15212#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15212#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:33,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {15222#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15212#(not (= (bvadd main_~c~0 (_ bv2 32)) ~last~0))} is VALID [2018-11-23 11:46:33,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {15222#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} assume !(~c~0 == ~last~0); {15222#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {15222#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {15222#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {15232#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15222#(not (= (bvadd ~last~0 (_ bv4294967293 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {15232#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} assume !(~c~0 == ~last~0); {15232#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} is VALID [2018-11-23 11:46:33,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {15232#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15232#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} is VALID [2018-11-23 11:46:33,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {15242#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15232#(not (= (bvadd main_~c~0 (_ bv4 32)) ~last~0))} is VALID [2018-11-23 11:46:33,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {15242#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} assume !(~c~0 == ~last~0); {15242#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:46:33,948 INFO L273 TraceCheckUtils]: 29: Hoare triple {15242#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15242#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:46:33,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {15252#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15242#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:46:33,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {15252#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} assume !(~c~0 == ~last~0); {15252#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {15252#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {15252#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {15262#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15252#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} is VALID [2018-11-23 11:46:33,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {15262#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} assume !(~c~0 == ~last~0); {15262#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:46:33,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {15262#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15262#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:46:34,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {15272#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15262#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:46:34,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {15272#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} assume !(~c~0 == ~last~0); {15272#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:46:34,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {15272#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {15272#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:46:34,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {15282#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15272#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:46:34,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {15282#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} assume !(~c~0 == ~last~0); {15282#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} is VALID [2018-11-23 11:46:34,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {15282#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {15282#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} is VALID [2018-11-23 11:46:34,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {15292#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15282#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} is VALID [2018-11-23 11:46:34,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {15012#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {15292#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} is VALID [2018-11-23 11:46:34,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {15012#true} assume !!~bvslt32(~c~0, 200000bv32); {15012#true} is VALID [2018-11-23 11:46:34,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {15012#true} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {15012#true} is VALID [2018-11-23 11:46:34,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {15012#true} assume !(~c~0 == ~last~0); {15012#true} is VALID [2018-11-23 11:46:34,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {15012#true} assume !!~bvslt32(~c~0, 200000bv32); {15012#true} is VALID [2018-11-23 11:46:34,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {15012#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {15012#true} is VALID [2018-11-23 11:46:34,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {15012#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {15012#true} is VALID [2018-11-23 11:46:34,064 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {15012#true} {15012#true} #69#return; {15012#true} is VALID [2018-11-23 11:46:34,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {15012#true} assume true; {15012#true} is VALID [2018-11-23 11:46:34,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {15012#true} havoc ~x~0;#res := ~x~0; {15012#true} is VALID [2018-11-23 11:46:34,065 INFO L256 TraceCheckUtils]: 5: Hoare triple {15012#true} call #t~ret0 := nondet(); {15012#true} is VALID [2018-11-23 11:46:34,065 INFO L256 TraceCheckUtils]: 4: Hoare triple {15012#true} call #t~ret2 := main(); {15012#true} is VALID [2018-11-23 11:46:34,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15012#true} {15012#true} #65#return; {15012#true} is VALID [2018-11-23 11:46:34,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {15012#true} assume true; {15012#true} is VALID [2018-11-23 11:46:34,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {15012#true} ~last~0 := 0bv32; {15012#true} is VALID [2018-11-23 11:46:34,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {15012#true} call ULTIMATE.init(); {15012#true} is VALID [2018-11-23 11:46:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 48 proven. 126 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:46:34,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:46:34,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-11-23 11:46:34,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-11-23 11:46:34,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:46:34,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:46:34,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:34,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:46:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:46:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:46:34,370 INFO L87 Difference]: Start difference. First operand 491 states and 560 transitions. Second operand 26 states. [2018-11-23 11:46:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:48,939 INFO L93 Difference]: Finished difference Result 1123 states and 1383 transitions. [2018-11-23 11:46:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:46:48,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-11-23 11:46:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:46:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:46:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 215 transitions. [2018-11-23 11:46:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:46:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 215 transitions. [2018-11-23 11:46:48,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 215 transitions. [2018-11-23 11:46:54,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:54,809 INFO L225 Difference]: With dead ends: 1123 [2018-11-23 11:46:54,809 INFO L226 Difference]: Without dead ends: 809 [2018-11-23 11:46:54,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=469, Invalid=1171, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:46:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-23 11:46:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 523. [2018-11-23 11:46:57,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:46:57,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 809 states. Second operand 523 states. [2018-11-23 11:46:57,719 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand 523 states. [2018-11-23 11:46:57,719 INFO L87 Difference]: Start difference. First operand 809 states. Second operand 523 states. [2018-11-23 11:46:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:57,753 INFO L93 Difference]: Finished difference Result 809 states and 959 transitions. [2018-11-23 11:46:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 959 transitions. [2018-11-23 11:46:57,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:57,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:57,756 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand 809 states. [2018-11-23 11:46:57,756 INFO L87 Difference]: Start difference. First operand 523 states. Second operand 809 states. [2018-11-23 11:46:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:57,793 INFO L93 Difference]: Finished difference Result 809 states and 959 transitions. [2018-11-23 11:46:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 959 transitions. [2018-11-23 11:46:57,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:57,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:57,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:46:57,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:46:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-11-23 11:46:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 600 transitions. [2018-11-23 11:46:57,816 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 600 transitions. Word has length 51 [2018-11-23 11:46:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:46:57,816 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 600 transitions. [2018-11-23 11:46:57,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:46:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 600 transitions. [2018-11-23 11:46:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 11:46:57,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:46:57,818 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:46:57,818 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:46:57,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:46:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1588793664, now seen corresponding path program 3 times [2018-11-23 11:46:57,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:46:57,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:46:57,843 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:46:58,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 11:46:58,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:46:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:58,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:46:58,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {19211#true} call ULTIMATE.init(); {19211#true} is VALID [2018-11-23 11:46:58,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {19211#true} ~last~0 := 0bv32; {19211#true} is VALID [2018-11-23 11:46:58,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:46:58,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19211#true} {19211#true} #65#return; {19211#true} is VALID [2018-11-23 11:46:58,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {19211#true} call #t~ret2 := main(); {19211#true} is VALID [2018-11-23 11:46:58,336 INFO L256 TraceCheckUtils]: 5: Hoare triple {19211#true} call #t~ret0 := nondet(); {19211#true} is VALID [2018-11-23 11:46:58,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {19211#true} havoc ~x~0;#res := ~x~0; {19211#true} is VALID [2018-11-23 11:46:58,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:46:58,336 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {19211#true} {19211#true} #69#return; {19211#true} is VALID [2018-11-23 11:46:58,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {19211#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {19211#true} is VALID [2018-11-23 11:46:58,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {19211#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {19246#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:58,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {19246#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {19246#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:58,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {19246#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {19246#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:46:58,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {19246#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19256#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {19256#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {19256#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {19256#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {19256#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {19256#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19266#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {19266#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {19266#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {19266#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {19266#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {19266#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19276#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {19276#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {19276#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:58,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {19276#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,347 INFO L273 TraceCheckUtils]: 33: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,381 INFO L273 TraceCheckUtils]: 35: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,386 INFO L273 TraceCheckUtils]: 40: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,387 INFO L273 TraceCheckUtils]: 42: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,387 INFO L273 TraceCheckUtils]: 43: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,388 INFO L273 TraceCheckUtils]: 45: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,388 INFO L273 TraceCheckUtils]: 46: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !!~bvslt32(~c~0, 200000bv32); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,391 INFO L273 TraceCheckUtils]: 51: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !(~c~0 == ~last~0); {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,391 INFO L273 TraceCheckUtils]: 52: Hoare triple {19283#(= (_ bv3 32) ~last~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19283#(= (_ bv3 32) ~last~0)} is VALID [2018-11-23 11:46:58,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {19283#(= (_ bv3 32) ~last~0)} assume !~bvslt32(~c~0, 200000bv32); {19380#(and (= (_ bv3 32) ~last~0) (not (bvslt main_~c~0 (_ bv200000 32))))} is VALID [2018-11-23 11:46:58,393 INFO L273 TraceCheckUtils]: 54: Hoare triple {19380#(and (= (_ bv3 32) ~last~0) (not (bvslt main_~c~0 (_ bv200000 32))))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {19380#(and (= (_ bv3 32) ~last~0) (not (bvslt main_~c~0 (_ bv200000 32))))} is VALID [2018-11-23 11:46:58,393 INFO L273 TraceCheckUtils]: 55: Hoare triple {19380#(and (= (_ bv3 32) ~last~0) (not (bvslt main_~c~0 (_ bv200000 32))))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {19212#false} is VALID [2018-11-23 11:46:58,394 INFO L256 TraceCheckUtils]: 56: Hoare triple {19212#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {19212#false} is VALID [2018-11-23 11:46:58,394 INFO L273 TraceCheckUtils]: 57: Hoare triple {19212#false} ~cond := #in~cond; {19212#false} is VALID [2018-11-23 11:46:58,394 INFO L273 TraceCheckUtils]: 58: Hoare triple {19212#false} assume 0bv32 == ~cond; {19212#false} is VALID [2018-11-23 11:46:58,394 INFO L273 TraceCheckUtils]: 59: Hoare triple {19212#false} assume !false; {19212#false} is VALID [2018-11-23 11:46:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 11:46:58,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:46:58,653 INFO L273 TraceCheckUtils]: 59: Hoare triple {19212#false} assume !false; {19212#false} is VALID [2018-11-23 11:46:58,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {19212#false} assume 0bv32 == ~cond; {19212#false} is VALID [2018-11-23 11:46:58,654 INFO L273 TraceCheckUtils]: 57: Hoare triple {19212#false} ~cond := #in~cond; {19212#false} is VALID [2018-11-23 11:46:58,654 INFO L256 TraceCheckUtils]: 56: Hoare triple {19212#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {19212#false} is VALID [2018-11-23 11:46:58,655 INFO L273 TraceCheckUtils]: 55: Hoare triple {19411#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0 && 0bv32 == ~st~0;~a~0 := ~bvadd32(1bv32, ~a~0); {19212#false} is VALID [2018-11-23 11:46:58,655 INFO L273 TraceCheckUtils]: 54: Hoare triple {19411#(not (= main_~c~0 ~last~0))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {19411#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:58,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {19411#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:46:58,656 INFO L273 TraceCheckUtils]: 52: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,656 INFO L273 TraceCheckUtils]: 51: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,657 INFO L273 TraceCheckUtils]: 48: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,659 INFO L273 TraceCheckUtils]: 45: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,662 INFO L273 TraceCheckUtils]: 39: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,662 INFO L273 TraceCheckUtils]: 38: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,664 INFO L273 TraceCheckUtils]: 35: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,668 INFO L273 TraceCheckUtils]: 27: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !(~c~0 == ~last~0); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {19418#(bvslt ~last~0 (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {19515#(bvslt main_~c~0 (_ bv200000 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {19418#(bvslt ~last~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {19515#(bvslt main_~c~0 (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19515#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {19522#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19515#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-23 11:46:58,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {19522#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {19522#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {19522#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19522#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {19532#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19522#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {19532#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {19532#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {19532#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19532#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {19542#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {19532#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {19542#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {19542#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {19542#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {19542#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {19211#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {19542#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:46:58,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {19211#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {19211#true} is VALID [2018-11-23 11:46:58,689 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {19211#true} {19211#true} #69#return; {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {19211#true} havoc ~x~0;#res := ~x~0; {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L256 TraceCheckUtils]: 5: Hoare triple {19211#true} call #t~ret0 := nondet(); {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {19211#true} call #t~ret2 := main(); {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19211#true} {19211#true} #65#return; {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {19211#true} ~last~0 := 0bv32; {19211#true} is VALID [2018-11-23 11:46:58,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {19211#true} call ULTIMATE.init(); {19211#true} is VALID [2018-11-23 11:46:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 11:46:58,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:46:58,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:46:58,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-11-23 11:46:58,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:46:58,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:46:58,775 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-23 11:46:58,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:46:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:46:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:46:58,776 INFO L87 Difference]: Start difference. First operand 523 states and 600 transitions. Second operand 14 states. [2018-11-23 11:47:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:47:03,752 INFO L93 Difference]: Finished difference Result 938 states and 1096 transitions. [2018-11-23 11:47:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:47:03,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-11-23 11:47:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:47:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:47:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 171 transitions. [2018-11-23 11:47:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:47:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 171 transitions. [2018-11-23 11:47:03,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 171 transitions. [2018-11-23 11:47:04,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:47:04,065 INFO L225 Difference]: With dead ends: 938 [2018-11-23 11:47:04,065 INFO L226 Difference]: Without dead ends: 671 [2018-11-23 11:47:04,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:47:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-23 11:47:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 605. [2018-11-23 11:47:06,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:47:06,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 671 states. Second operand 605 states. [2018-11-23 11:47:06,756 INFO L74 IsIncluded]: Start isIncluded. First operand 671 states. Second operand 605 states. [2018-11-23 11:47:06,757 INFO L87 Difference]: Start difference. First operand 671 states. Second operand 605 states. [2018-11-23 11:47:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:47:06,773 INFO L93 Difference]: Finished difference Result 671 states and 773 transitions. [2018-11-23 11:47:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 773 transitions. [2018-11-23 11:47:06,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:47:06,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:47:06,775 INFO L74 IsIncluded]: Start isIncluded. First operand 605 states. Second operand 671 states. [2018-11-23 11:47:06,775 INFO L87 Difference]: Start difference. First operand 605 states. Second operand 671 states. [2018-11-23 11:47:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:47:06,794 INFO L93 Difference]: Finished difference Result 671 states and 773 transitions. [2018-11-23 11:47:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 773 transitions. [2018-11-23 11:47:06,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:47:06,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:47:06,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:47:06,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:47:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-11-23 11:47:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 693 transitions. [2018-11-23 11:47:06,820 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 693 transitions. Word has length 60 [2018-11-23 11:47:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:47:06,820 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 693 transitions. [2018-11-23 11:47:06,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:47:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 693 transitions. [2018-11-23 11:47:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 11:47:06,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:47:06,822 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:47:06,823 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:47:06,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:47:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1013736736, now seen corresponding path program 1 times [2018-11-23 11:47:06,823 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:47:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:47:06,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:47:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:47:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:47:06,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:47:07,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {23076#true} call ULTIMATE.init(); {23076#true} is VALID [2018-11-23 11:47:07,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {23076#true} ~last~0 := 0bv32; {23076#true} is VALID [2018-11-23 11:47:07,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {23076#true} assume true; {23076#true} is VALID [2018-11-23 11:47:07,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23076#true} {23076#true} #65#return; {23076#true} is VALID [2018-11-23 11:47:07,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {23076#true} call #t~ret2 := main(); {23076#true} is VALID [2018-11-23 11:47:07,131 INFO L256 TraceCheckUtils]: 5: Hoare triple {23076#true} call #t~ret0 := nondet(); {23076#true} is VALID [2018-11-23 11:47:07,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {23076#true} havoc ~x~0;#res := ~x~0; {23076#true} is VALID [2018-11-23 11:47:07,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {23076#true} assume true; {23076#true} is VALID [2018-11-23 11:47:07,132 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {23076#true} {23076#true} #69#return; {23076#true} is VALID [2018-11-23 11:47:07,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {23076#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {23076#true} is VALID [2018-11-23 11:47:07,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {23076#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {23111#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:47:07,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {23111#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23111#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:47:07,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {23111#(= main_~c~0 (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {23111#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:47:07,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {23111#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23121#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {23121#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23121#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {23121#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23121#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {23121#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23131#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {23131#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23131#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {23131#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23131#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {23131#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23141#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {23141#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23141#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {23141#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23141#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {23141#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23151#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {23151#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23151#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {23151#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23151#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {23151#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23161#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {23161#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23161#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {23161#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23161#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {23161#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23171#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-23 11:47:07,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {23171#(= (_ bv6 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {23171#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-23 11:47:07,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {23171#(= (_ bv6 32) main_~c~0)} assume !(~c~0 == ~last~0); {23171#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-23 11:47:07,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {23171#(= (_ bv6 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23181#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {23181#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23181#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {23181#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23181#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {23181#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23191#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-23 11:47:07,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {23191#(= (_ bv8 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {23191#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-23 11:47:07,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {23191#(= (_ bv8 32) main_~c~0)} assume !(~c~0 == ~last~0); {23191#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-23 11:47:07,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {23191#(= (_ bv8 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23201#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {23201#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {23201#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {23201#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {23201#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:47:07,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {23201#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23211#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-23 11:47:07,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {23211#(= (_ bv10 32) main_~c~0)} assume !~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {23077#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {23077#false} is VALID [2018-11-23 11:47:07,150 INFO L273 TraceCheckUtils]: 43: Hoare triple {23077#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {23077#false} is VALID [2018-11-23 11:47:07,150 INFO L256 TraceCheckUtils]: 44: Hoare triple {23077#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {23077#false} is VALID [2018-11-23 11:47:07,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {23077#false} ~cond := #in~cond; {23077#false} is VALID [2018-11-23 11:47:07,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {23077#false} assume !(0bv32 == ~cond); {23077#false} is VALID [2018-11-23 11:47:07,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {23077#false} assume true; {23077#false} is VALID [2018-11-23 11:47:07,151 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {23077#false} {23077#false} #71#return; {23077#false} is VALID [2018-11-23 11:47:07,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {23077#false} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {23077#false} is VALID [2018-11-23 11:47:07,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {23077#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {23077#false} is VALID [2018-11-23 11:47:07,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,153 INFO L273 TraceCheckUtils]: 59: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 65: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 66: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 67: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,154 INFO L273 TraceCheckUtils]: 68: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 69: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 70: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 73: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 74: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 75: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,155 INFO L273 TraceCheckUtils]: 76: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 77: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 78: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 79: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {23077#false} assume !~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {23077#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {23077#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L256 TraceCheckUtils]: 83: Hoare triple {23077#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {23077#false} is VALID [2018-11-23 11:47:07,156 INFO L273 TraceCheckUtils]: 84: Hoare triple {23077#false} ~cond := #in~cond; {23077#false} is VALID [2018-11-23 11:47:07,157 INFO L273 TraceCheckUtils]: 85: Hoare triple {23077#false} assume 0bv32 == ~cond; {23077#false} is VALID [2018-11-23 11:47:07,157 INFO L273 TraceCheckUtils]: 86: Hoare triple {23077#false} assume !false; {23077#false} is VALID [2018-11-23 11:47:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 322 proven. 145 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 11:47:07,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:47:07,813 INFO L273 TraceCheckUtils]: 86: Hoare triple {23077#false} assume !false; {23077#false} is VALID [2018-11-23 11:47:07,813 INFO L273 TraceCheckUtils]: 85: Hoare triple {23077#false} assume 0bv32 == ~cond; {23077#false} is VALID [2018-11-23 11:47:07,813 INFO L273 TraceCheckUtils]: 84: Hoare triple {23077#false} ~cond := #in~cond; {23077#false} is VALID [2018-11-23 11:47:07,814 INFO L256 TraceCheckUtils]: 83: Hoare triple {23077#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {23077#false} is VALID [2018-11-23 11:47:07,814 INFO L273 TraceCheckUtils]: 82: Hoare triple {23077#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {23077#false} is VALID [2018-11-23 11:47:07,814 INFO L273 TraceCheckUtils]: 81: Hoare triple {23077#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {23077#false} is VALID [2018-11-23 11:47:07,814 INFO L273 TraceCheckUtils]: 80: Hoare triple {23077#false} assume !~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,814 INFO L273 TraceCheckUtils]: 79: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,815 INFO L273 TraceCheckUtils]: 78: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,815 INFO L273 TraceCheckUtils]: 77: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,815 INFO L273 TraceCheckUtils]: 76: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,815 INFO L273 TraceCheckUtils]: 75: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,815 INFO L273 TraceCheckUtils]: 74: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,815 INFO L273 TraceCheckUtils]: 73: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 72: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 71: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 67: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 66: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,816 INFO L273 TraceCheckUtils]: 65: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 63: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 61: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 60: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 59: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,817 INFO L273 TraceCheckUtils]: 57: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {23077#false} assume !(~c~0 == ~last~0); {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {23077#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {23077#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 50: Hoare triple {23077#false} assume !!~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L273 TraceCheckUtils]: 49: Hoare triple {23077#false} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {23077#false} is VALID [2018-11-23 11:47:07,818 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {23076#true} {23077#false} #71#return; {23077#false} is VALID [2018-11-23 11:47:07,819 INFO L273 TraceCheckUtils]: 47: Hoare triple {23076#true} assume true; {23076#true} is VALID [2018-11-23 11:47:07,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {23076#true} assume !(0bv32 == ~cond); {23076#true} is VALID [2018-11-23 11:47:07,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {23076#true} ~cond := #in~cond; {23076#true} is VALID [2018-11-23 11:47:07,819 INFO L256 TraceCheckUtils]: 44: Hoare triple {23077#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {23076#true} is VALID [2018-11-23 11:47:07,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {23077#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {23077#false} is VALID [2018-11-23 11:47:07,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {23077#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {23077#false} is VALID [2018-11-23 11:47:07,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {23485#(bvslt main_~c~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {23077#false} is VALID [2018-11-23 11:47:07,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {23489#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23485#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-23 11:47:07,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {23489#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23489#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {23489#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23489#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {23499#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23489#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {23499#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23499#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {23499#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23499#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {23509#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23499#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {23509#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23509#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {23509#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23509#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {23519#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23509#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {23519#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23519#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {23519#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23519#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {23529#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23519#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {23529#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23529#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {23529#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23529#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {23539#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23529#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {23539#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23539#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,858 INFO L273 TraceCheckUtils]: 23: Hoare triple {23539#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23539#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {23549#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23539#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,867 INFO L273 TraceCheckUtils]: 21: Hoare triple {23549#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23549#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {23549#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23549#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {23559#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23549#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {23559#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23559#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {23559#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23559#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {23569#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23559#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {23569#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {23569#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {23569#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23569#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {23579#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {23569#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {23579#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {23579#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {23579#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {23579#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {23076#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {23579#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-23 11:47:07,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {23076#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {23076#true} is VALID [2018-11-23 11:47:07,889 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {23076#true} {23076#true} #69#return; {23076#true} is VALID [2018-11-23 11:47:07,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {23076#true} assume true; {23076#true} is VALID [2018-11-23 11:47:07,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {23076#true} havoc ~x~0;#res := ~x~0; {23076#true} is VALID [2018-11-23 11:47:07,889 INFO L256 TraceCheckUtils]: 5: Hoare triple {23076#true} call #t~ret0 := nondet(); {23076#true} is VALID [2018-11-23 11:47:07,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {23076#true} call #t~ret2 := main(); {23076#true} is VALID [2018-11-23 11:47:07,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23076#true} {23076#true} #65#return; {23076#true} is VALID [2018-11-23 11:47:07,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {23076#true} assume true; {23076#true} is VALID [2018-11-23 11:47:07,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {23076#true} ~last~0 := 0bv32; {23076#true} is VALID [2018-11-23 11:47:07,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {23076#true} call ULTIMATE.init(); {23076#true} is VALID [2018-11-23 11:47:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-11-23 11:47:07,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:47:07,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:47:07,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-11-23 11:47:07,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:47:07,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:47:08,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:47:08,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:47:08,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:47:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:47:08,066 INFO L87 Difference]: Start difference. First operand 605 states and 693 transitions. Second operand 24 states. [2018-11-23 11:47:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:47:25,001 INFO L93 Difference]: Finished difference Result 2267 states and 2853 transitions. [2018-11-23 11:47:25,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:47:25,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-11-23 11:47:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:47:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:47:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2018-11-23 11:47:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:47:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2018-11-23 11:47:25,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 140 transitions. [2018-11-23 11:47:25,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:47:25,427 INFO L225 Difference]: With dead ends: 2267 [2018-11-23 11:47:25,427 INFO L226 Difference]: Without dead ends: 1939 [2018-11-23 11:47:25,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:47:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2018-11-23 11:47:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1875. [2018-11-23 11:47:38,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:47:38,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1939 states. Second operand 1875 states. [2018-11-23 11:47:38,063 INFO L74 IsIncluded]: Start isIncluded. First operand 1939 states. Second operand 1875 states. [2018-11-23 11:47:38,063 INFO L87 Difference]: Start difference. First operand 1939 states. Second operand 1875 states. [2018-11-23 11:47:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:47:38,178 INFO L93 Difference]: Finished difference Result 1939 states and 2081 transitions. [2018-11-23 11:47:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2081 transitions. [2018-11-23 11:47:38,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:47:38,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:47:38,181 INFO L74 IsIncluded]: Start isIncluded. First operand 1875 states. Second operand 1939 states. [2018-11-23 11:47:38,181 INFO L87 Difference]: Start difference. First operand 1875 states. Second operand 1939 states. [2018-11-23 11:47:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:47:38,327 INFO L93 Difference]: Finished difference Result 1939 states and 2081 transitions. [2018-11-23 11:47:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2081 transitions. [2018-11-23 11:47:38,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:47:38,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:47:38,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:47:38,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:47:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-23 11:47:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2017 transitions. [2018-11-23 11:47:38,539 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2017 transitions. Word has length 87 [2018-11-23 11:47:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:47:38,539 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 2017 transitions. [2018-11-23 11:47:38,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:47:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2017 transitions. [2018-11-23 11:47:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 11:47:38,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:47:38,543 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 40, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:47:38,544 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:47:38,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:47:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1966719776, now seen corresponding path program 2 times [2018-11-23 11:47:38,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:47:38,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:47:38,561 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:47:38,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:47:38,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:47:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:47:38,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:47:39,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {33087#true} call ULTIMATE.init(); {33087#true} is VALID [2018-11-23 11:47:39,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {33087#true} ~last~0 := 0bv32; {33087#true} is VALID [2018-11-23 11:47:39,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {33087#true} assume true; {33087#true} is VALID [2018-11-23 11:47:39,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33087#true} {33087#true} #65#return; {33087#true} is VALID [2018-11-23 11:47:39,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {33087#true} call #t~ret2 := main(); {33087#true} is VALID [2018-11-23 11:47:39,529 INFO L256 TraceCheckUtils]: 5: Hoare triple {33087#true} call #t~ret0 := nondet(); {33087#true} is VALID [2018-11-23 11:47:39,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {33087#true} havoc ~x~0;#res := ~x~0; {33087#true} is VALID [2018-11-23 11:47:39,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {33087#true} assume true; {33087#true} is VALID [2018-11-23 11:47:39,530 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {33087#true} {33087#true} #69#return; {33087#true} is VALID [2018-11-23 11:47:39,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {33087#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {33087#true} is VALID [2018-11-23 11:47:39,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {33087#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {33122#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:47:39,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {33122#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {33122#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:47:39,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {33122#(= main_~c~0 (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33129#(and (= main_~c~0 (_ bv0 32)) (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:47:39,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {33129#(and (= main_~c~0 (_ bv0 32)) (= main_~c~0 ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33133#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {33133#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33133#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {33133#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33133#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {33133#(and (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33143#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {33143#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33143#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {33143#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33143#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {33143#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) ~last~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33153#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:47:39,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {33153#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {33153#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:47:39,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {33153#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} assume !(~c~0 == ~last~0); {33153#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} is VALID [2018-11-23 11:47:39,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {33153#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv3 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33163#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {33163#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33163#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {33163#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33163#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {33163#(and (= (bvadd main_~c~0 (_ bv4294967292 32)) ~last~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33173#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:47:39,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {33173#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {33173#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:47:39,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {33173#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} assume !(~c~0 == ~last~0); {33173#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} is VALID [2018-11-23 11:47:39,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {33173#(and (= ~last~0 (_ bv0 32)) (= (bvadd main_~c~0 (_ bv4294967291 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33183#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {33183#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33183#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {33183#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33183#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,546 INFO L273 TraceCheckUtils]: 31: Hoare triple {33183#(and (= (bvadd ~last~0 (_ bv6 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33193#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {33193#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33193#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {33193#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33193#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {33193#(and (= (bvadd main_~c~0 (_ bv4294967289 32)) ~last~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33203#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:47:39,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {33203#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {33203#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:47:39,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {33203#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} assume !(~c~0 == ~last~0); {33203#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} is VALID [2018-11-23 11:47:39,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {33203#(and (= ~last~0 (_ bv0 32)) (= (bvadd ~last~0 (_ bv8 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33213#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {33213#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33213#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {33213#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33213#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {33213#(and (= (bvadd main_~c~0 (_ bv4294967287 32)) ~last~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33223#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {33223#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33223#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {33223#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {33223#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {33223#(and (= (bvadd ~last~0 (_ bv10 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33233#(and (= (bvadd ~last~0 (_ bv11 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {33233#(and (= (bvadd ~last~0 (_ bv11 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {33233#(and (= (bvadd ~last~0 (_ bv11 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} is VALID [2018-11-23 11:47:39,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {33233#(and (= (bvadd ~last~0 (_ bv11 32)) main_~c~0) (= ~last~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:39,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,559 INFO L273 TraceCheckUtils]: 51: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,559 INFO L273 TraceCheckUtils]: 52: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,559 INFO L273 TraceCheckUtils]: 53: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,560 INFO L273 TraceCheckUtils]: 54: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,560 INFO L273 TraceCheckUtils]: 55: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,560 INFO L273 TraceCheckUtils]: 56: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,560 INFO L273 TraceCheckUtils]: 58: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 60: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 61: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 64: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 66: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,562 INFO L273 TraceCheckUtils]: 68: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,562 INFO L273 TraceCheckUtils]: 70: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,562 INFO L273 TraceCheckUtils]: 71: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,562 INFO L273 TraceCheckUtils]: 72: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,562 INFO L273 TraceCheckUtils]: 73: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,563 INFO L273 TraceCheckUtils]: 74: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,563 INFO L273 TraceCheckUtils]: 75: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,563 INFO L273 TraceCheckUtils]: 76: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,563 INFO L273 TraceCheckUtils]: 77: Hoare triple {33088#false} assume !~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,563 INFO L273 TraceCheckUtils]: 78: Hoare triple {33088#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {33088#false} is VALID [2018-11-23 11:47:39,564 INFO L273 TraceCheckUtils]: 79: Hoare triple {33088#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {33088#false} is VALID [2018-11-23 11:47:39,564 INFO L256 TraceCheckUtils]: 80: Hoare triple {33088#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {33088#false} is VALID [2018-11-23 11:47:39,564 INFO L273 TraceCheckUtils]: 81: Hoare triple {33088#false} ~cond := #in~cond; {33088#false} is VALID [2018-11-23 11:47:39,564 INFO L273 TraceCheckUtils]: 82: Hoare triple {33088#false} assume !(0bv32 == ~cond); {33088#false} is VALID [2018-11-23 11:47:39,564 INFO L273 TraceCheckUtils]: 83: Hoare triple {33088#false} assume true; {33088#false} is VALID [2018-11-23 11:47:39,564 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {33088#false} {33088#false} #71#return; {33088#false} is VALID [2018-11-23 11:47:39,565 INFO L273 TraceCheckUtils]: 85: Hoare triple {33088#false} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:39,565 INFO L273 TraceCheckUtils]: 86: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,565 INFO L273 TraceCheckUtils]: 87: Hoare triple {33088#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:39,565 INFO L273 TraceCheckUtils]: 88: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,565 INFO L273 TraceCheckUtils]: 89: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,566 INFO L273 TraceCheckUtils]: 90: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,566 INFO L273 TraceCheckUtils]: 91: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,566 INFO L273 TraceCheckUtils]: 92: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,566 INFO L273 TraceCheckUtils]: 93: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,566 INFO L273 TraceCheckUtils]: 94: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,566 INFO L273 TraceCheckUtils]: 95: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,567 INFO L273 TraceCheckUtils]: 96: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,567 INFO L273 TraceCheckUtils]: 97: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,567 INFO L273 TraceCheckUtils]: 98: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,567 INFO L273 TraceCheckUtils]: 99: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,567 INFO L273 TraceCheckUtils]: 100: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,568 INFO L273 TraceCheckUtils]: 101: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,568 INFO L273 TraceCheckUtils]: 102: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,568 INFO L273 TraceCheckUtils]: 103: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,568 INFO L273 TraceCheckUtils]: 104: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,568 INFO L273 TraceCheckUtils]: 105: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,568 INFO L273 TraceCheckUtils]: 106: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,569 INFO L273 TraceCheckUtils]: 107: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,569 INFO L273 TraceCheckUtils]: 108: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,569 INFO L273 TraceCheckUtils]: 109: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,569 INFO L273 TraceCheckUtils]: 110: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,569 INFO L273 TraceCheckUtils]: 111: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,570 INFO L273 TraceCheckUtils]: 112: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,570 INFO L273 TraceCheckUtils]: 113: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,570 INFO L273 TraceCheckUtils]: 114: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,570 INFO L273 TraceCheckUtils]: 115: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,570 INFO L273 TraceCheckUtils]: 116: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,570 INFO L273 TraceCheckUtils]: 117: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,571 INFO L273 TraceCheckUtils]: 118: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,571 INFO L273 TraceCheckUtils]: 119: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,571 INFO L273 TraceCheckUtils]: 120: Hoare triple {33088#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:39,571 INFO L273 TraceCheckUtils]: 121: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,571 INFO L273 TraceCheckUtils]: 122: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,572 INFO L273 TraceCheckUtils]: 123: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,572 INFO L273 TraceCheckUtils]: 124: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,572 INFO L273 TraceCheckUtils]: 125: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,572 INFO L273 TraceCheckUtils]: 126: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,572 INFO L273 TraceCheckUtils]: 127: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,572 INFO L273 TraceCheckUtils]: 128: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,573 INFO L273 TraceCheckUtils]: 129: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,573 INFO L273 TraceCheckUtils]: 130: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,573 INFO L273 TraceCheckUtils]: 131: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,573 INFO L273 TraceCheckUtils]: 132: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,573 INFO L273 TraceCheckUtils]: 133: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,574 INFO L273 TraceCheckUtils]: 134: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,574 INFO L273 TraceCheckUtils]: 135: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,574 INFO L273 TraceCheckUtils]: 136: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,574 INFO L273 TraceCheckUtils]: 137: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,574 INFO L273 TraceCheckUtils]: 138: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,574 INFO L273 TraceCheckUtils]: 139: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,575 INFO L273 TraceCheckUtils]: 140: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,575 INFO L273 TraceCheckUtils]: 141: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,575 INFO L273 TraceCheckUtils]: 142: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,575 INFO L273 TraceCheckUtils]: 143: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,575 INFO L273 TraceCheckUtils]: 144: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,575 INFO L273 TraceCheckUtils]: 145: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,576 INFO L273 TraceCheckUtils]: 146: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,576 INFO L273 TraceCheckUtils]: 147: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,576 INFO L273 TraceCheckUtils]: 148: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,576 INFO L273 TraceCheckUtils]: 149: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,576 INFO L273 TraceCheckUtils]: 150: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:39,577 INFO L273 TraceCheckUtils]: 151: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:39,577 INFO L273 TraceCheckUtils]: 152: Hoare triple {33088#false} assume !~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:39,577 INFO L273 TraceCheckUtils]: 153: Hoare triple {33088#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {33088#false} is VALID [2018-11-23 11:47:39,577 INFO L273 TraceCheckUtils]: 154: Hoare triple {33088#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {33088#false} is VALID [2018-11-23 11:47:39,577 INFO L256 TraceCheckUtils]: 155: Hoare triple {33088#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {33088#false} is VALID [2018-11-23 11:47:39,578 INFO L273 TraceCheckUtils]: 156: Hoare triple {33088#false} ~cond := #in~cond; {33088#false} is VALID [2018-11-23 11:47:39,578 INFO L273 TraceCheckUtils]: 157: Hoare triple {33088#false} assume 0bv32 == ~cond; {33088#false} is VALID [2018-11-23 11:47:39,578 INFO L273 TraceCheckUtils]: 158: Hoare triple {33088#false} assume !false; {33088#false} is VALID [2018-11-23 11:47:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 1156 proven. 187 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2018-11-23 11:47:39,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:47:40,630 INFO L273 TraceCheckUtils]: 158: Hoare triple {33088#false} assume !false; {33088#false} is VALID [2018-11-23 11:47:40,630 INFO L273 TraceCheckUtils]: 157: Hoare triple {33088#false} assume 0bv32 == ~cond; {33088#false} is VALID [2018-11-23 11:47:40,631 INFO L273 TraceCheckUtils]: 156: Hoare triple {33088#false} ~cond := #in~cond; {33088#false} is VALID [2018-11-23 11:47:40,631 INFO L256 TraceCheckUtils]: 155: Hoare triple {33088#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {33088#false} is VALID [2018-11-23 11:47:40,631 INFO L273 TraceCheckUtils]: 154: Hoare triple {33088#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {33088#false} is VALID [2018-11-23 11:47:40,631 INFO L273 TraceCheckUtils]: 153: Hoare triple {33088#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {33088#false} is VALID [2018-11-23 11:47:40,631 INFO L273 TraceCheckUtils]: 152: Hoare triple {33088#false} assume !~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 151: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 150: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 149: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 148: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 147: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 146: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 145: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 144: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,632 INFO L273 TraceCheckUtils]: 143: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 142: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 141: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 140: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 139: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 138: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 137: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 136: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 135: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,633 INFO L273 TraceCheckUtils]: 134: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 133: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 132: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 131: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 130: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 129: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 128: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 127: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,634 INFO L273 TraceCheckUtils]: 126: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 125: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 124: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 123: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 122: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 121: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 120: Hoare triple {33088#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 119: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 118: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,635 INFO L273 TraceCheckUtils]: 117: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 116: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 115: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 114: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 112: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 111: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 110: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,636 INFO L273 TraceCheckUtils]: 109: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 108: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 107: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 106: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 105: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 104: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 103: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 102: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,637 INFO L273 TraceCheckUtils]: 101: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 100: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 99: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 98: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 97: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 96: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 95: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 94: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 93: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,638 INFO L273 TraceCheckUtils]: 92: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 91: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 90: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 89: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 88: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 87: Hoare triple {33088#false} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 86: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 85: Hoare triple {33088#false} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {33087#true} {33088#false} #71#return; {33088#false} is VALID [2018-11-23 11:47:40,639 INFO L273 TraceCheckUtils]: 83: Hoare triple {33087#true} assume true; {33087#true} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 82: Hoare triple {33087#true} assume !(0bv32 == ~cond); {33087#true} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 81: Hoare triple {33087#true} ~cond := #in~cond; {33087#true} is VALID [2018-11-23 11:47:40,640 INFO L256 TraceCheckUtils]: 80: Hoare triple {33088#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {33087#true} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 79: Hoare triple {33088#false} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {33088#false} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 78: Hoare triple {33088#false} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {33088#false} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 77: Hoare triple {33088#false} assume !~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 74: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 73: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 72: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 71: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 70: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 69: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 67: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,641 INFO L273 TraceCheckUtils]: 66: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 64: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 63: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 62: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 61: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 60: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 57: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 56: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {33088#false} assume !(~c~0 == ~last~0); {33088#false} is VALID [2018-11-23 11:47:40,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {33088#false} assume !!~bvslt32(~c~0, 200000bv32); {33088#false} is VALID [2018-11-23 11:47:40,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {33088#false} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33088#false} is VALID [2018-11-23 11:47:40,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {33918#(not (= main_~c~0 ~last~0))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {33088#false} is VALID [2018-11-23 11:47:40,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {33918#(not (= main_~c~0 ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {33918#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:47:40,656 INFO L273 TraceCheckUtils]: 43: Hoare triple {33925#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33918#(not (= main_~c~0 ~last~0))} is VALID [2018-11-23 11:47:40,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {33925#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !(~c~0 == ~last~0); {33925#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:47:40,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {33925#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {33925#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:47:40,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {33935#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33925#(not (= (bvadd main_~c~0 (_ bv1 32)) ~last~0))} is VALID [2018-11-23 11:47:40,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {33935#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} assume !(~c~0 == ~last~0); {33935#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {33935#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {33935#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {33945#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33935#(not (= (bvadd ~last~0 (_ bv4294967294 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {33945#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} assume !(~c~0 == ~last~0); {33945#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:47:40,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {33945#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {33945#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:47:40,738 INFO L273 TraceCheckUtils]: 34: Hoare triple {33955#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33945#(not (= (bvadd main_~c~0 (_ bv3 32)) ~last~0))} is VALID [2018-11-23 11:47:40,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {33955#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} assume !(~c~0 == ~last~0); {33955#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,739 INFO L273 TraceCheckUtils]: 32: Hoare triple {33955#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {33955#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {33965#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33955#(not (= (bvadd ~last~0 (_ bv4294967292 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {33965#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} assume !(~c~0 == ~last~0); {33965#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:47:40,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {33965#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {33965#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:47:40,785 INFO L273 TraceCheckUtils]: 28: Hoare triple {33975#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33965#(not (= (bvadd main_~c~0 (_ bv5 32)) ~last~0))} is VALID [2018-11-23 11:47:40,786 INFO L273 TraceCheckUtils]: 27: Hoare triple {33975#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} assume !(~c~0 == ~last~0); {33975#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,786 INFO L273 TraceCheckUtils]: 26: Hoare triple {33975#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {33975#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {33985#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33975#(not (= (bvadd ~last~0 (_ bv4294967290 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {33985#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} assume !(~c~0 == ~last~0); {33985#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:47:40,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {33985#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {33985#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:47:40,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {33995#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33985#(not (= (bvadd main_~c~0 (_ bv7 32)) ~last~0))} is VALID [2018-11-23 11:47:40,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {33995#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} assume !(~c~0 == ~last~0); {33995#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {33995#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} assume !!~bvslt32(~c~0, 200000bv32); {33995#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {34005#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {33995#(not (= (bvadd ~last~0 (_ bv4294967288 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {34005#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} assume !(~c~0 == ~last~0); {34005#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} is VALID [2018-11-23 11:47:40,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {34005#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {34005#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} is VALID [2018-11-23 11:47:40,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {34015#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {34005#(not (= (bvadd main_~c~0 (_ bv9 32)) ~last~0))} is VALID [2018-11-23 11:47:40,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {34015#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} assume !(~c~0 == ~last~0); {34015#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} is VALID [2018-11-23 11:47:40,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {34015#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} assume !!~bvslt32(~c~0, 200000bv32); {34015#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} is VALID [2018-11-23 11:47:40,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {34025#(not (= (bvadd ~last~0 (_ bv4294967285 32)) main_~c~0))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {34015#(not (= (bvadd main_~c~0 (_ bv10 32)) ~last~0))} is VALID [2018-11-23 11:47:40,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {33087#true} assume ~c~0 == ~last~0;~st~0 := 0bv32; {34025#(not (= (bvadd ~last~0 (_ bv4294967285 32)) main_~c~0))} is VALID [2018-11-23 11:47:40,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {33087#true} assume !!~bvslt32(~c~0, 200000bv32); {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {33087#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {33087#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {33087#true} {33087#true} #69#return; {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {33087#true} assume true; {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {33087#true} havoc ~x~0;#res := ~x~0; {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L256 TraceCheckUtils]: 5: Hoare triple {33087#true} call #t~ret0 := nondet(); {33087#true} is VALID [2018-11-23 11:47:40,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {33087#true} call #t~ret2 := main(); {33087#true} is VALID [2018-11-23 11:47:40,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33087#true} {33087#true} #65#return; {33087#true} is VALID [2018-11-23 11:47:40,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {33087#true} assume true; {33087#true} is VALID [2018-11-23 11:47:40,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {33087#true} ~last~0 := 0bv32; {33087#true} is VALID [2018-11-23 11:47:40,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {33087#true} call ULTIMATE.init(); {33087#true} is VALID [2018-11-23 11:47:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 1180 proven. 165 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2018-11-23 11:47:40,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:47:40,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-23 11:47:40,917 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 159 [2018-11-23 11:47:40,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:47:40,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:47:41,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:47:41,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:47:41,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:47:41,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:47:41,280 INFO L87 Difference]: Start difference. First operand 1875 states and 2017 transitions. Second operand 27 states. [2018-11-23 11:47:42,202 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 11:47:42,508 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:47:46,142 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:48:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:00,831 INFO L93 Difference]: Finished difference Result 3206 states and 3542 transitions. [2018-11-23 11:48:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:48:00,832 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 159 [2018-11-23 11:48:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:48:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:48:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 200 transitions. [2018-11-23 11:48:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:48:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 200 transitions. [2018-11-23 11:48:00,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 200 transitions. [2018-11-23 11:48:06,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:06,369 INFO L225 Difference]: With dead ends: 3206 [2018-11-23 11:48:06,369 INFO L226 Difference]: Without dead ends: 1914 [2018-11-23 11:48:06,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:48:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-11-23 11:48:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1575. [2018-11-23 11:48:18,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:48:18,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1914 states. Second operand 1575 states. [2018-11-23 11:48:18,348 INFO L74 IsIncluded]: Start isIncluded. First operand 1914 states. Second operand 1575 states. [2018-11-23 11:48:18,348 INFO L87 Difference]: Start difference. First operand 1914 states. Second operand 1575 states. [2018-11-23 11:48:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:18,493 INFO L93 Difference]: Finished difference Result 1914 states and 2102 transitions. [2018-11-23 11:48:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2102 transitions. [2018-11-23 11:48:18,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:18,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:18,496 INFO L74 IsIncluded]: Start isIncluded. First operand 1575 states. Second operand 1914 states. [2018-11-23 11:48:18,496 INFO L87 Difference]: Start difference. First operand 1575 states. Second operand 1914 states. [2018-11-23 11:48:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:18,644 INFO L93 Difference]: Finished difference Result 1914 states and 2102 transitions. [2018-11-23 11:48:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2102 transitions. [2018-11-23 11:48:18,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:18,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:18,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:48:18,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:48:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-11-23 11:48:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1701 transitions. [2018-11-23 11:48:18,739 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1701 transitions. Word has length 159 [2018-11-23 11:48:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:48:18,739 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 1701 transitions. [2018-11-23 11:48:18,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:48:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1701 transitions. [2018-11-23 11:48:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 11:48:18,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:48:18,742 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 42, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:48:18,742 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:48:18,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:48:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2123238880, now seen corresponding path program 3 times [2018-11-23 11:48:18,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:48:18,743 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:48:18,767 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:48:18,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:48:18,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:48:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:48:18,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:48:19,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {44366#true} call ULTIMATE.init(); {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {44366#true} ~last~0 := 0bv32; {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {44366#true} assume true; {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44366#true} {44366#true} #65#return; {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {44366#true} call #t~ret2 := main(); {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L256 TraceCheckUtils]: 5: Hoare triple {44366#true} call #t~ret0 := nondet(); {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {44366#true} havoc ~x~0;#res := ~x~0; {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {44366#true} assume true; {44366#true} is VALID [2018-11-23 11:48:19,326 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {44366#true} {44366#true} #69#return; {44366#true} is VALID [2018-11-23 11:48:19,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {44366#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,332 INFO L273 TraceCheckUtils]: 21: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,344 INFO L273 TraceCheckUtils]: 38: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,347 INFO L273 TraceCheckUtils]: 43: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,349 INFO L273 TraceCheckUtils]: 46: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,350 INFO L273 TraceCheckUtils]: 47: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,350 INFO L273 TraceCheckUtils]: 48: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,351 INFO L273 TraceCheckUtils]: 49: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,352 INFO L273 TraceCheckUtils]: 50: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,352 INFO L273 TraceCheckUtils]: 51: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,353 INFO L273 TraceCheckUtils]: 52: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,354 INFO L273 TraceCheckUtils]: 53: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,355 INFO L273 TraceCheckUtils]: 54: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,355 INFO L273 TraceCheckUtils]: 55: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,356 INFO L273 TraceCheckUtils]: 56: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,357 INFO L273 TraceCheckUtils]: 57: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,357 INFO L273 TraceCheckUtils]: 58: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,358 INFO L273 TraceCheckUtils]: 59: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,359 INFO L273 TraceCheckUtils]: 60: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,359 INFO L273 TraceCheckUtils]: 61: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,360 INFO L273 TraceCheckUtils]: 62: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,361 INFO L273 TraceCheckUtils]: 63: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,361 INFO L273 TraceCheckUtils]: 64: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,362 INFO L273 TraceCheckUtils]: 65: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,363 INFO L273 TraceCheckUtils]: 66: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,363 INFO L273 TraceCheckUtils]: 67: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,364 INFO L273 TraceCheckUtils]: 68: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,364 INFO L273 TraceCheckUtils]: 69: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,365 INFO L273 TraceCheckUtils]: 70: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,366 INFO L273 TraceCheckUtils]: 71: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,366 INFO L273 TraceCheckUtils]: 72: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,367 INFO L273 TraceCheckUtils]: 73: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,368 INFO L273 TraceCheckUtils]: 74: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,369 INFO L273 TraceCheckUtils]: 76: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,370 INFO L273 TraceCheckUtils]: 77: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !~bvslt32(~c~0, 200000bv32); {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:48:19,371 INFO L273 TraceCheckUtils]: 78: Hoare triple {44398#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,371 INFO L273 TraceCheckUtils]: 79: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,372 INFO L256 TraceCheckUtils]: 80: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {44366#true} is VALID [2018-11-23 11:48:19,372 INFO L273 TraceCheckUtils]: 81: Hoare triple {44366#true} ~cond := #in~cond; {44366#true} is VALID [2018-11-23 11:48:19,372 INFO L273 TraceCheckUtils]: 82: Hoare triple {44366#true} assume !(0bv32 == ~cond); {44366#true} is VALID [2018-11-23 11:48:19,372 INFO L273 TraceCheckUtils]: 83: Hoare triple {44366#true} assume true; {44366#true} is VALID [2018-11-23 11:48:19,373 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {44366#true} {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #71#return; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,374 INFO L273 TraceCheckUtils]: 85: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,374 INFO L273 TraceCheckUtils]: 86: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,375 INFO L273 TraceCheckUtils]: 87: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,376 INFO L273 TraceCheckUtils]: 88: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,377 INFO L273 TraceCheckUtils]: 89: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,377 INFO L273 TraceCheckUtils]: 90: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,378 INFO L273 TraceCheckUtils]: 91: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,379 INFO L273 TraceCheckUtils]: 92: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,380 INFO L273 TraceCheckUtils]: 93: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,380 INFO L273 TraceCheckUtils]: 94: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,381 INFO L273 TraceCheckUtils]: 95: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,382 INFO L273 TraceCheckUtils]: 96: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,382 INFO L273 TraceCheckUtils]: 97: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,383 INFO L273 TraceCheckUtils]: 98: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,384 INFO L273 TraceCheckUtils]: 99: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,385 INFO L273 TraceCheckUtils]: 100: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,385 INFO L273 TraceCheckUtils]: 101: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,386 INFO L273 TraceCheckUtils]: 102: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,387 INFO L273 TraceCheckUtils]: 103: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,388 INFO L273 TraceCheckUtils]: 104: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,388 INFO L273 TraceCheckUtils]: 105: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,389 INFO L273 TraceCheckUtils]: 106: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,390 INFO L273 TraceCheckUtils]: 107: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,390 INFO L273 TraceCheckUtils]: 108: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,391 INFO L273 TraceCheckUtils]: 109: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,392 INFO L273 TraceCheckUtils]: 110: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,393 INFO L273 TraceCheckUtils]: 111: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,393 INFO L273 TraceCheckUtils]: 112: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,394 INFO L273 TraceCheckUtils]: 113: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,395 INFO L273 TraceCheckUtils]: 114: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,395 INFO L273 TraceCheckUtils]: 115: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,396 INFO L273 TraceCheckUtils]: 116: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,397 INFO L273 TraceCheckUtils]: 117: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,398 INFO L273 TraceCheckUtils]: 118: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,398 INFO L273 TraceCheckUtils]: 119: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,399 INFO L273 TraceCheckUtils]: 120: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,400 INFO L273 TraceCheckUtils]: 121: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,400 INFO L273 TraceCheckUtils]: 122: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,401 INFO L273 TraceCheckUtils]: 123: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,402 INFO L273 TraceCheckUtils]: 124: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,403 INFO L273 TraceCheckUtils]: 125: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,403 INFO L273 TraceCheckUtils]: 126: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,404 INFO L273 TraceCheckUtils]: 127: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,405 INFO L273 TraceCheckUtils]: 128: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,405 INFO L273 TraceCheckUtils]: 129: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,406 INFO L273 TraceCheckUtils]: 130: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,407 INFO L273 TraceCheckUtils]: 131: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,408 INFO L273 TraceCheckUtils]: 132: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,408 INFO L273 TraceCheckUtils]: 133: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,409 INFO L273 TraceCheckUtils]: 134: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,410 INFO L273 TraceCheckUtils]: 135: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,410 INFO L273 TraceCheckUtils]: 136: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,411 INFO L273 TraceCheckUtils]: 137: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,412 INFO L273 TraceCheckUtils]: 138: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,413 INFO L273 TraceCheckUtils]: 139: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,413 INFO L273 TraceCheckUtils]: 140: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,414 INFO L273 TraceCheckUtils]: 141: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,415 INFO L273 TraceCheckUtils]: 142: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,416 INFO L273 TraceCheckUtils]: 143: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,416 INFO L273 TraceCheckUtils]: 144: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,417 INFO L273 TraceCheckUtils]: 145: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,418 INFO L273 TraceCheckUtils]: 146: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,418 INFO L273 TraceCheckUtils]: 147: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,419 INFO L273 TraceCheckUtils]: 148: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,420 INFO L273 TraceCheckUtils]: 149: Hoare triple {44606#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {44820#(and (bvslt main_~c~0 (_ bv200000 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,421 INFO L273 TraceCheckUtils]: 150: Hoare triple {44820#(and (bvslt main_~c~0 (_ bv200000 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0); {44820#(and (bvslt main_~c~0 (_ bv200000 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,428 INFO L273 TraceCheckUtils]: 151: Hoare triple {44820#(and (bvslt main_~c~0 (_ bv200000 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44827#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,429 INFO L273 TraceCheckUtils]: 152: Hoare triple {44827#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~c~0, 200000bv32); {44831#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:19,431 INFO L273 TraceCheckUtils]: 153: Hoare triple {44831#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {44835#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (_ bv4 32) main_~b~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (_ bv4 32) main_~a~0))} is VALID [2018-11-23 11:48:19,432 INFO L273 TraceCheckUtils]: 154: Hoare triple {44835#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (_ bv4 32) main_~b~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (_ bv4 32) main_~a~0))} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {44835#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (_ bv4 32) main_~b~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (_ bv4 32) main_~a~0))} is VALID [2018-11-23 11:48:19,437 INFO L256 TraceCheckUtils]: 155: Hoare triple {44835#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (_ bv4 32) main_~b~0) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (_ bv4 32) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {44842#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:48:19,438 INFO L273 TraceCheckUtils]: 156: Hoare triple {44842#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {44846#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:48:19,438 INFO L273 TraceCheckUtils]: 157: Hoare triple {44846#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {44367#false} is VALID [2018-11-23 11:48:19,438 INFO L273 TraceCheckUtils]: 158: Hoare triple {44367#false} assume !false; {44367#false} is VALID [2018-11-23 11:48:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 66 proven. 1501 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2018-11-23 11:48:19,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:48:20,172 INFO L273 TraceCheckUtils]: 158: Hoare triple {44367#false} assume !false; {44367#false} is VALID [2018-11-23 11:48:20,173 INFO L273 TraceCheckUtils]: 157: Hoare triple {44856#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {44367#false} is VALID [2018-11-23 11:48:20,173 INFO L273 TraceCheckUtils]: 156: Hoare triple {44860#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {44856#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:48:20,174 INFO L256 TraceCheckUtils]: 155: Hoare triple {44864#(and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {44860#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:48:20,175 INFO L273 TraceCheckUtils]: 154: Hoare triple {44864#(and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {44864#(and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:20,177 INFO L273 TraceCheckUtils]: 153: Hoare triple {44864#(and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32)))} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {44864#(and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:20,177 INFO L273 TraceCheckUtils]: 152: Hoare triple {44874#(or (bvslt main_~c~0 (_ bv200000 32)) (and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32))))} assume !~bvslt32(~c~0, 200000bv32); {44864#(and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32)))} is VALID [2018-11-23 11:48:20,179 INFO L273 TraceCheckUtils]: 151: Hoare triple {44878#(or (and (= (bvadd main_~c~0 (_ bv4294767297 32)) (_ bv0 32)) (= main_~a~0 main_~b~0)) (bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44874#(or (bvslt main_~c~0 (_ bv200000 32)) (and (= main_~a~0 main_~b~0) (= (bvadd main_~c~0 (_ bv4294767296 32)) (_ bv0 32))))} is VALID [2018-11-23 11:48:20,179 INFO L273 TraceCheckUtils]: 150: Hoare triple {44878#(or (and (= (bvadd main_~c~0 (_ bv4294767297 32)) (_ bv0 32)) (= main_~a~0 main_~b~0)) (bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32)))} assume !(~c~0 == ~last~0); {44878#(or (and (= (bvadd main_~c~0 (_ bv4294767297 32)) (_ bv0 32)) (= main_~a~0 main_~b~0)) (bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32)))} is VALID [2018-11-23 11:48:20,182 INFO L273 TraceCheckUtils]: 149: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44878#(or (and (= (bvadd main_~c~0 (_ bv4294767297 32)) (_ bv0 32)) (= main_~a~0 main_~b~0)) (bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32)))} is VALID [2018-11-23 11:48:20,182 INFO L273 TraceCheckUtils]: 148: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,183 INFO L273 TraceCheckUtils]: 147: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,183 INFO L273 TraceCheckUtils]: 146: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,183 INFO L273 TraceCheckUtils]: 145: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,183 INFO L273 TraceCheckUtils]: 144: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,184 INFO L273 TraceCheckUtils]: 143: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,184 INFO L273 TraceCheckUtils]: 142: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,184 INFO L273 TraceCheckUtils]: 141: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,185 INFO L273 TraceCheckUtils]: 140: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,185 INFO L273 TraceCheckUtils]: 139: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,186 INFO L273 TraceCheckUtils]: 138: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,186 INFO L273 TraceCheckUtils]: 137: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,187 INFO L273 TraceCheckUtils]: 136: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,187 INFO L273 TraceCheckUtils]: 135: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,188 INFO L273 TraceCheckUtils]: 134: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,188 INFO L273 TraceCheckUtils]: 133: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,189 INFO L273 TraceCheckUtils]: 132: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,189 INFO L273 TraceCheckUtils]: 131: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,190 INFO L273 TraceCheckUtils]: 130: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,190 INFO L273 TraceCheckUtils]: 129: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,191 INFO L273 TraceCheckUtils]: 128: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,191 INFO L273 TraceCheckUtils]: 127: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,192 INFO L273 TraceCheckUtils]: 126: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,192 INFO L273 TraceCheckUtils]: 125: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,193 INFO L273 TraceCheckUtils]: 124: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,193 INFO L273 TraceCheckUtils]: 123: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,194 INFO L273 TraceCheckUtils]: 122: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,194 INFO L273 TraceCheckUtils]: 121: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,195 INFO L273 TraceCheckUtils]: 120: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,195 INFO L273 TraceCheckUtils]: 119: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,196 INFO L273 TraceCheckUtils]: 118: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,196 INFO L273 TraceCheckUtils]: 117: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,197 INFO L273 TraceCheckUtils]: 116: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,197 INFO L273 TraceCheckUtils]: 115: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,198 INFO L273 TraceCheckUtils]: 114: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,215 INFO L273 TraceCheckUtils]: 113: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,229 INFO L273 TraceCheckUtils]: 112: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,242 INFO L273 TraceCheckUtils]: 111: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,251 INFO L273 TraceCheckUtils]: 110: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,254 INFO L273 TraceCheckUtils]: 109: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,254 INFO L273 TraceCheckUtils]: 108: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,255 INFO L273 TraceCheckUtils]: 107: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,255 INFO L273 TraceCheckUtils]: 106: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,255 INFO L273 TraceCheckUtils]: 105: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,256 INFO L273 TraceCheckUtils]: 104: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,256 INFO L273 TraceCheckUtils]: 103: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,256 INFO L273 TraceCheckUtils]: 102: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,256 INFO L273 TraceCheckUtils]: 101: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,257 INFO L273 TraceCheckUtils]: 100: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,257 INFO L273 TraceCheckUtils]: 99: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,257 INFO L273 TraceCheckUtils]: 98: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,258 INFO L273 TraceCheckUtils]: 97: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,258 INFO L273 TraceCheckUtils]: 96: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,258 INFO L273 TraceCheckUtils]: 95: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,259 INFO L273 TraceCheckUtils]: 94: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,259 INFO L273 TraceCheckUtils]: 93: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,261 INFO L273 TraceCheckUtils]: 90: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,261 INFO L273 TraceCheckUtils]: 89: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,262 INFO L273 TraceCheckUtils]: 88: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,263 INFO L273 TraceCheckUtils]: 87: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume ~c~0 == ~last~0;~st~0 := 0bv32; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,263 INFO L273 TraceCheckUtils]: 86: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,264 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {44366#true} {44885#(= main_~a~0 main_~b~0)} #71#return; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,265 INFO L273 TraceCheckUtils]: 83: Hoare triple {44366#true} assume true; {44366#true} is VALID [2018-11-23 11:48:20,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {44366#true} assume !(0bv32 == ~cond); {44366#true} is VALID [2018-11-23 11:48:20,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {44366#true} ~cond := #in~cond; {44366#true} is VALID [2018-11-23 11:48:20,265 INFO L256 TraceCheckUtils]: 80: Hoare triple {44885#(= main_~a~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000bv32 == ~c~0 then 1bv32 else 0bv32)); {44366#true} is VALID [2018-11-23 11:48:20,266 INFO L273 TraceCheckUtils]: 79: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0 && 0bv32 == ~st~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,266 INFO L273 TraceCheckUtils]: 78: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(0bv32 == ~st~0 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,267 INFO L273 TraceCheckUtils]: 77: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,267 INFO L273 TraceCheckUtils]: 76: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,267 INFO L273 TraceCheckUtils]: 75: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,268 INFO L273 TraceCheckUtils]: 74: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,268 INFO L273 TraceCheckUtils]: 73: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,268 INFO L273 TraceCheckUtils]: 72: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,269 INFO L273 TraceCheckUtils]: 71: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,269 INFO L273 TraceCheckUtils]: 70: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,270 INFO L273 TraceCheckUtils]: 69: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,270 INFO L273 TraceCheckUtils]: 68: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,271 INFO L273 TraceCheckUtils]: 67: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,271 INFO L273 TraceCheckUtils]: 66: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,272 INFO L273 TraceCheckUtils]: 65: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,272 INFO L273 TraceCheckUtils]: 64: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,273 INFO L273 TraceCheckUtils]: 62: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,275 INFO L273 TraceCheckUtils]: 59: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,275 INFO L273 TraceCheckUtils]: 58: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,277 INFO L273 TraceCheckUtils]: 55: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,277 INFO L273 TraceCheckUtils]: 54: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,278 INFO L273 TraceCheckUtils]: 53: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,278 INFO L273 TraceCheckUtils]: 52: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,280 INFO L273 TraceCheckUtils]: 49: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,281 INFO L273 TraceCheckUtils]: 47: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,283 INFO L273 TraceCheckUtils]: 43: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,289 INFO L273 TraceCheckUtils]: 32: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !(~c~0 == ~last~0); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {44885#(= main_~a~0 main_~b~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume ~c~0 == ~last~0;~st~0 := 0bv32; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !!~bvslt32(~c~0, 200000bv32); {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {44885#(= main_~a~0 main_~b~0)} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {44366#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {44885#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:48:20,301 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {44366#true} {44366#true} #69#return; {44366#true} is VALID [2018-11-23 11:48:20,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {44366#true} assume true; {44366#true} is VALID [2018-11-23 11:48:20,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {44366#true} havoc ~x~0;#res := ~x~0; {44366#true} is VALID [2018-11-23 11:48:20,301 INFO L256 TraceCheckUtils]: 5: Hoare triple {44366#true} call #t~ret0 := nondet(); {44366#true} is VALID [2018-11-23 11:48:20,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {44366#true} call #t~ret2 := main(); {44366#true} is VALID [2018-11-23 11:48:20,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44366#true} {44366#true} #65#return; {44366#true} is VALID [2018-11-23 11:48:20,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {44366#true} assume true; {44366#true} is VALID [2018-11-23 11:48:20,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {44366#true} ~last~0 := 0bv32; {44366#true} is VALID [2018-11-23 11:48:20,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {44366#true} call ULTIMATE.init(); {44366#true} is VALID [2018-11-23 11:48:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2933 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 2797 trivial. 0 not checked. [2018-11-23 11:48:20,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:48:20,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-23 11:48:20,323 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-11-23 11:48:20,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:48:20,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:48:20,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:20,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:48:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:48:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:48:20,440 INFO L87 Difference]: Start difference. First operand 1575 states and 1701 transitions. Second operand 16 states. [2018-11-23 11:48:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:41,500 INFO L93 Difference]: Finished difference Result 2357 states and 2549 transitions. [2018-11-23 11:48:41,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:48:41,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-11-23 11:48:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:48:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:48:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2018-11-23 11:48:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:48:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2018-11-23 11:48:41,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2018-11-23 11:48:41,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:48:41,624 INFO L225 Difference]: With dead ends: 2357 [2018-11-23 11:48:41,624 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:48:41,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:48:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:48:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:48:41,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:48:41,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:41,630 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:41,630 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:41,630 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:48:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:48:41,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:41,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:41,631 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:41,631 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:48:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:48:41,631 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:48:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:48:41,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:41,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:48:41,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:48:41,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:48:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:48:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:48:41,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-11-23 11:48:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:48:41,633 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:48:41,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:48:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:48:41,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:48:41,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:48:41,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:41,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:42,030 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 30 [2018-11-23 11:48:42,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:43,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:44,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:44,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:44,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:44,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:44,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:45,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:45,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:45,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:45,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:45,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:45,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:46,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:46,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:46,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:46,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:46,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:47,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:47,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,223 WARN L180 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 1184 DAG size of output: 595 [2018-11-23 11:48:48,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:48:48,654 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 26