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_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:16:21,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:21,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:21,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:21,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:21,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:21,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:21,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:21,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:21,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:21,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:21,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:21,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:21,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:21,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:21,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:21,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:21,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:21,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:21,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:21,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:21,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:21,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:21,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:21,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:21,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:21,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:21,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:21,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:21,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:21,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:21,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:21,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:21,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:21,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:21,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:21,455 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:16:21,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:21,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:21,488 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:21,489 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:21,489 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:21,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:21,491 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:21,491 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:21,491 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:21,491 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:21,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:21,492 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:21,492 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:21,492 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:21,492 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:21,492 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:21,494 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:21,494 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:21,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:21,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:21,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:21,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:21,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:21,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:21,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:21,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:21,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:21,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:21,497 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:21,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:21,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:16:21,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:21,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:21,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:21,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:21,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:21,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-23 13:16:21,633 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98707ac66/b2f767186e6842de89c8f56323f9aebf/FLAG2b3d72fec [2018-11-23 13:16:22,080 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:22,081 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-23 13:16:22,088 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98707ac66/b2f767186e6842de89c8f56323f9aebf/FLAG2b3d72fec [2018-11-23 13:16:22,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98707ac66/b2f767186e6842de89c8f56323f9aebf [2018-11-23 13:16:22,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:22,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:22,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:22,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:22,489 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:22,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e17b6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22, skipping insertion in model container [2018-11-23 13:16:22,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:22,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:22,787 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:22,796 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:22,818 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:22,836 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:22,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22 WrapperNode [2018-11-23 13:16:22,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:22,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:22,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:22,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:22,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:22,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:22,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:22,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:22,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (1/1) ... [2018-11-23 13:16:22,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:22,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:22,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:22,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:22,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (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 13:16:23,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:23,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:23,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:23,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:23,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:16:23,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:16:23,593 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:23,593 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:16:23,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:23 BoogieIcfgContainer [2018-11-23 13:16:23,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:23,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:23,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:23,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:23,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:22" (1/3) ... [2018-11-23 13:16:23,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17953b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:23, skipping insertion in model container [2018-11-23 13:16:23,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:22" (2/3) ... [2018-11-23 13:16:23,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17953b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:23, skipping insertion in model container [2018-11-23 13:16:23,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:23" (3/3) ... [2018-11-23 13:16:23,603 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_true-unreach-call1.c [2018-11-23 13:16:23,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:23,619 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:23,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:23,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:23,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:23,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:23,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:23,671 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:23,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:23,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:23,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:23,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:16:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:23,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:23,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:23,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:23,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:16:23,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:23,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:23,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:23,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:16:23,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:16:23,837 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 13:16:23,838 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 13:16:23,838 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2018-11-23 13:16:23,842 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:16:23,842 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-23 13:16:23,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:16:23,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:16:23,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:16:23,846 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 13:16:23,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:23,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:23,856 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:23,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:23,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:16:23,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:23,939 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:16:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:24,025 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:16:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:24,026 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:16:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:16:24,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 13:16:24,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:24,182 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:16:24,182 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:16:24,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:16:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:16:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:16:24,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:24,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:24,314 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:24,314 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:24,318 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:16:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:16:24,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:24,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:24,319 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:24,319 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:24,322 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:16:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:16:24,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:24,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:24,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:24,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:16:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:16:24,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 13:16:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:24,328 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:16:24,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:16:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:24,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:24,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:24,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:24,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 13:16:24,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:24,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:24,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:24,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:16:24,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:16:24,632 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #37#return; {106#true} is VALID [2018-11-23 13:16:24,632 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-23 13:16:24,635 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:24,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {107#false} is VALID [2018-11-23 13:16:24,638 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {107#false} is VALID [2018-11-23 13:16:24,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:16:24,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:16:24,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:16:24,640 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 13:16:24,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:24,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:16:24,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:16:24,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:24,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:16:24,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:24,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:16:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:16:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:24,675 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 13:16:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:24,798 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:16:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:16:24,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:16:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:16:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:16:24,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 13:16:24,976 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 13:16:24,978 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:16:24,978 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:16:24,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:16:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:16:24,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:24,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:24,986 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:24,986 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:24,988 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:16:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:24,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:24,989 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:24,990 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:24,991 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:16:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:24,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:24,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:24,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:24,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:16:24,994 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:16:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:24,995 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:16:24,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:16:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:16:24,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:24,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:24,996 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:24,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 13:16:24,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:24,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:24,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:24,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:24,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:16:25,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:16:25,156 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:16:25,156 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:16:25,157 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~x~0 := 0; {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:25,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {194#false} is VALID [2018-11-23 13:16:25,161 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {194#false} is VALID [2018-11-23 13:16:25,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:16:25,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:16:25,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:16:25,166 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 13:16:25,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:25,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:25,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:16:25,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:16:25,542 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:16:25,542 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:16:25,555 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~x~0 := 0; {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:25,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {194#false} is VALID [2018-11-23 13:16:25,595 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {194#false} is VALID [2018-11-23 13:16:25,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:16:25,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:16:25,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:16:25,597 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 13:16:25,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:25,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:16:25,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:16:25,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:25,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:16:25,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:25,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:16:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:16:25,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:25,693 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 13:16:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:25,983 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:16:25,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:16:25,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:16:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:16:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:16:25,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-23 13:16:26,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:26,114 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:16:26,114 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:16:26,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:16:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:16:26,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:26,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:26,149 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:26,149 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:26,152 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:16:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:26,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:26,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:26,153 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:26,153 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:26,155 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:16:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:26,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:26,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:26,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:26,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:16:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:16:26,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 13:16:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:26,158 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:16:26,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:16:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:16:26,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:26,160 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:26,160 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:26,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2018-11-23 13:16:26,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:26,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:26,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:16:26,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:16:26,379 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:16:26,379 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:16:26,380 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#true} ~x~0 := 0; {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,382 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:26,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {326#false} is VALID [2018-11-23 13:16:26,405 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {326#false} is VALID [2018-11-23 13:16:26,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:16:26,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:16:26,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:16:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:26,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:26,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:26,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:26,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:26,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:26,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:26,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:16:26,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:16:26,525 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:16:26,525 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:16:26,527 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#true} ~x~0 := 0; {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:26,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 100000000); {326#false} is VALID [2018-11-23 13:16:26,543 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {326#false} is VALID [2018-11-23 13:16:26,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:16:26,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:16:26,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:16:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:26,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:26,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:16:26,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:16:26,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:26,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:16:26,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:26,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:16:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:16:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:26,606 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2018-11-23 13:16:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:26,913 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:16:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:16:26,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:16:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:16:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:16:26,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2018-11-23 13:16:26,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:26,980 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:16:26,980 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:16:26,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:16:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:16:27,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:27,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:27,006 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:27,006 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:27,008 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:16:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:27,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:27,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:27,009 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:27,010 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:27,012 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:16:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:27,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:27,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:27,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:27,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:16:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:16:27,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 13:16:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:27,015 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:16:27,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:16:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:16:27,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:27,016 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:27,016 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:27,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2018-11-23 13:16:27,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:27,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:27,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:16:27,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:16:27,222 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:16:27,222 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:16:27,223 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:27,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {475#false} is VALID [2018-11-23 13:16:27,236 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {475#false} is VALID [2018-11-23 13:16:27,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:16:27,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:16:27,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:16:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:27,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:27,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:27,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:27,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:16:27,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:27,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:16:27,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:16:27,322 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:16:27,323 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:16:27,323 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {474#true} is VALID [2018-11-23 13:16:27,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 100000000); {474#true} is VALID [2018-11-23 13:16:27,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {474#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:16:27,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 100000000); {474#true} is VALID [2018-11-23 13:16:27,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:16:27,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 100000000); {474#true} is VALID [2018-11-23 13:16:27,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {474#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:16:27,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {475#false} is VALID [2018-11-23 13:16:27,326 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {475#false} is VALID [2018-11-23 13:16:27,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:16:27,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:16:27,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:16:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:16:27,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:27,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 13:16:27,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:16:27,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:27,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:16:27,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:16:27,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:16:27,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:27,391 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2018-11-23 13:16:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:27,562 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 13:16:27,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:16:27,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:16:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:16:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:16:27,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 13:16:27,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:27,631 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:16:27,632 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:16:27,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:16:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:16:27,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:27,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:16:27,652 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:16:27,653 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:16:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:27,655 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:16:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:16:27,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:27,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:27,656 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:16:27,656 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:16:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:27,658 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:16:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:16:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:27,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:27,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:16:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 13:16:27,661 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-23 13:16:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:27,661 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 13:16:27,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:16:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 13:16:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:16:27,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:27,662 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:27,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:27,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1988642215, now seen corresponding path program 1 times [2018-11-23 13:16:27,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:27,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:27,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:16:27,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:16:27,900 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:16:27,901 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:16:27,905 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} ~x~0 := 0; {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:27,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:27,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:27,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {652#false} is VALID [2018-11-23 13:16:27,917 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2018-11-23 13:16:27,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:16:27,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:16:27,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:16:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:27,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:27,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:27,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:28,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:16:28,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:16:28,236 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:16:28,236 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:16:28,238 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} ~x~0 := 0; {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:28,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:28,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:28,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:28,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:28,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:28,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:28,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:28,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:28,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:28,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {652#false} is VALID [2018-11-23 13:16:28,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#false} assume !(~x~0 % 4294967296 < 100000000); {652#false} is VALID [2018-11-23 13:16:28,266 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2018-11-23 13:16:28,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:16:28,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:16:28,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:16:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:28,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:28,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-23 13:16:28,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:16:28,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:28,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:16:28,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:28,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:16:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:16:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:28,370 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-11-23 13:16:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:28,877 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:16:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:16:28,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:16:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:16:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:16:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:16:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:16:28,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2018-11-23 13:16:28,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:28,994 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:16:28,994 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:16:28,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:16:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:16:29,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:29,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:29,037 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:29,037 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:29,039 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:16:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:16:29,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:29,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:29,040 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:29,040 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:29,042 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:16:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:16:29,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:29,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:29,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:29,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:16:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 13:16:29,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-11-23 13:16:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:29,045 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 13:16:29,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:16:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:16:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:16:29,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:29,047 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:29,047 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:29,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1105955487, now seen corresponding path program 2 times [2018-11-23 13:16:29,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:29,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:29,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:16:29,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:16:29,634 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:16:29,634 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:16:29,635 INFO L273 TraceCheckUtils]: 4: Hoare triple {858#true} ~x~0 := 0; {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:29,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:29,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:29,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:29,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:29,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:29,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:29,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:29,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:29,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:29,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:29,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:29,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:29,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:29,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:29,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {859#false} is VALID [2018-11-23 13:16:29,651 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {859#false} is VALID [2018-11-23 13:16:29,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:16:29,651 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:16:29,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:16:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:29,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:29,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:29,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:29,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:29,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:29,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:29,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:16:29,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:16:29,865 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:16:29,865 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:16:29,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {858#true} ~x~0 := 0; {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:29,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:29,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:29,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:29,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:29,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:29,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:29,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:29,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:29,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:29,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:29,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:29,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:29,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:29,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:29,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 100000000); {859#false} is VALID [2018-11-23 13:16:29,883 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {859#false} is VALID [2018-11-23 13:16:29,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:16:29,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:16:29,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:16:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:29,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:29,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:16:29,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:16:29,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:29,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:16:29,952 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 13:16:29,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:16:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:16:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:16:29,953 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-23 13:16:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,435 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:16:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:16:30,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:16:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:16:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:16:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:16:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:16:30,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 13:16:30,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:30,509 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:16:30,510 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:16:30,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:16:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:16:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:16:30,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:30,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:30,544 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:30,544 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,547 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:16:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:16:30,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:30,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:30,548 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:30,548 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,550 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:16:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:16:30,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:30,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:30,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:30,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:16:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 13:16:30,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-23 13:16:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:30,553 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 13:16:30,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:16:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:16:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:16:30,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:30,553 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:30,554 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:30,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 3029019, now seen corresponding path program 3 times [2018-11-23 13:16:30,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:30,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:30,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:30,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:30,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:31,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:16:31,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:16:31,017 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:16:31,017 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:16:31,018 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:31,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:31,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:31,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:31,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:31,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:31,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:31,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:31,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:31,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:31,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:31,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:31,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:31,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:31,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:31,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:31,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:31,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:31,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:31,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {1101#false} is VALID [2018-11-23 13:16:31,048 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2018-11-23 13:16:31,048 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:16:31,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:16:31,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:16:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:31,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:31,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:31,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:31,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:16:31,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:31,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:31,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:16:31,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:16:31,219 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:16:31,220 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:16:31,220 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1100#true} is VALID [2018-11-23 13:16:31,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:31,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:31,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:16:31,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:16:31,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1182#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:16:31,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {1182#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {1101#false} is VALID [2018-11-23 13:16:31,229 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2018-11-23 13:16:31,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:16:31,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:16:31,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:16:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 13:16:31,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:31,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-11-23 13:16:31,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:16:31,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:31,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:16:31,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:31,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:16:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:16:31,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:16:31,337 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-11-23 13:16:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:35,756 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 13:16:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:16:35,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:16:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-23 13:16:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-23 13:16:35,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 53 transitions. [2018-11-23 13:16:35,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:35,997 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:16:35,997 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:16:35,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:16:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:16:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 13:16:36,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:36,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-23 13:16:36,068 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-23 13:16:36,068 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-23 13:16:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:36,070 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:16:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:16:36,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:36,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:36,071 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-23 13:16:36,071 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-23 13:16:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:36,073 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:16:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:16:36,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:36,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:36,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:36,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:16:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 13:16:36,076 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-11-23 13:16:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:36,076 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 13:16:36,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:16:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:16:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:16:36,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:36,077 INFO L402 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:36,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:36,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1686757776, now seen corresponding path program 4 times [2018-11-23 13:16:36,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:36,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:36,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:36,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:36,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:37,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-23 13:16:37,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-23 13:16:37,550 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #37#return; {1401#true} is VALID [2018-11-23 13:16:37,551 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret1 := main(); {1401#true} is VALID [2018-11-23 13:16:37,553 INFO L273 TraceCheckUtils]: 4: Hoare triple {1401#true} ~x~0 := 0; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:37,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:37,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:37,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:37,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:37,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:37,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:37,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:37,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:37,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:37,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:37,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:37,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:37,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:37,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:37,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:37,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:37,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:37,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:37,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:37,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:37,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:37,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:37,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:37,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1415#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:37,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {1415#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {1402#false} is VALID [2018-11-23 13:16:37,586 INFO L256 TraceCheckUtils]: 30: Hoare triple {1402#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1402#false} is VALID [2018-11-23 13:16:37,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-23 13:16:37,587 INFO L273 TraceCheckUtils]: 32: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-23 13:16:37,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-23 13:16:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:37,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:37,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:37,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:37,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:37,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:37,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:37,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-23 13:16:37,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-23 13:16:37,798 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #37#return; {1401#true} is VALID [2018-11-23 13:16:37,799 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret1 := main(); {1401#true} is VALID [2018-11-23 13:16:37,800 INFO L273 TraceCheckUtils]: 4: Hoare triple {1401#true} ~x~0 := 0; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:37,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:37,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:37,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:37,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:37,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:37,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:37,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:37,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:37,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:37,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:37,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:37,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:37,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:37,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:37,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:37,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:37,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:37,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:37,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:37,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:37,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:37,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1402#false} is VALID [2018-11-23 13:16:37,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {1402#false} assume !!(~x~0 % 4294967296 < 100000000); {1402#false} is VALID [2018-11-23 13:16:37,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1402#false} is VALID [2018-11-23 13:16:37,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < 100000000); {1402#false} is VALID [2018-11-23 13:16:37,820 INFO L256 TraceCheckUtils]: 30: Hoare triple {1402#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1402#false} is VALID [2018-11-23 13:16:37,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-23 13:16:37,820 INFO L273 TraceCheckUtils]: 32: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-23 13:16:37,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-23 13:16:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:37,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:37,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 15 [2018-11-23 13:16:37,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:16:37,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:37,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:16:37,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:37,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:16:37,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:16:37,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:16:37,910 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 15 states. [2018-11-23 13:16:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:38,970 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 13:16:38,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:16:38,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:16:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:16:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:16:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:16:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:16:38,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2018-11-23 13:16:39,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:39,027 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:16:39,027 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:16:39,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:16:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:16:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:16:39,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:39,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 13:16:39,065 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:16:39,066 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:16:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,068 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:16:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:16:39,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:39,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:39,069 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:16:39,069 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:16:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:39,071 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:16:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:16:39,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:39,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:39,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:39,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:16:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 13:16:39,074 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-11-23 13:16:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:39,074 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:16:39,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:16:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:16:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:16:39,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:39,075 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:39,075 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:39,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 419627978, now seen corresponding path program 5 times [2018-11-23 13:16:39,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:39,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:39,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:39,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2018-11-23 13:16:39,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2018-11-23 13:16:39,696 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #37#return; {1730#true} is VALID [2018-11-23 13:16:39,696 INFO L256 TraceCheckUtils]: 3: Hoare triple {1730#true} call #t~ret1 := main(); {1730#true} is VALID [2018-11-23 13:16:39,697 INFO L273 TraceCheckUtils]: 4: Hoare triple {1730#true} ~x~0 := 0; {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:39,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:39,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:39,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:39,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:39,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:39,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:39,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:39,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:39,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:39,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:39,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:39,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:39,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:39,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:39,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:39,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:39,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:39,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:39,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:39,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:39,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:39,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:16:39,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:16:39,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:39,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:39,729 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:16:39,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:16:39,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1746#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:39,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {1746#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {1731#false} is VALID [2018-11-23 13:16:39,732 INFO L256 TraceCheckUtils]: 34: Hoare triple {1731#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1731#false} is VALID [2018-11-23 13:16:39,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {1731#false} ~cond := #in~cond; {1731#false} is VALID [2018-11-23 13:16:39,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {1731#false} assume 0 == ~cond; {1731#false} is VALID [2018-11-23 13:16:39,733 INFO L273 TraceCheckUtils]: 37: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2018-11-23 13:16:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:39,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:39,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:39,748 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:17:51,209 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-23 13:17:51,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:51,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:51,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2018-11-23 13:17:51,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2018-11-23 13:17:51,443 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #37#return; {1730#true} is VALID [2018-11-23 13:17:51,443 INFO L256 TraceCheckUtils]: 3: Hoare triple {1730#true} call #t~ret1 := main(); {1730#true} is VALID [2018-11-23 13:17:51,443 INFO L273 TraceCheckUtils]: 4: Hoare triple {1730#true} ~x~0 := 0; {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:51,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:51,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:51,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:51,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:51,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:51,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:51,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:51,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:51,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:51,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:51,452 INFO L273 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:51,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:51,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:51,454 INFO L273 TraceCheckUtils]: 18: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:51,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:51,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:51,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:51,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:51,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:51,459 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:51,460 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:51,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:51,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:51,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:51,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:51,469 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:51,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:51,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1731#false} is VALID [2018-11-23 13:17:51,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {1731#false} assume !(~x~0 % 4294967296 < 100000000); {1731#false} is VALID [2018-11-23 13:17:51,470 INFO L256 TraceCheckUtils]: 34: Hoare triple {1731#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1731#false} is VALID [2018-11-23 13:17:51,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {1731#false} ~cond := #in~cond; {1731#false} is VALID [2018-11-23 13:17:51,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {1731#false} assume 0 == ~cond; {1731#false} is VALID [2018-11-23 13:17:51,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2018-11-23 13:17:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:51,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:51,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-11-23 13:17:51,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:17:51,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:51,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:17:51,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:51,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:17:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:17:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:17:51,537 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 17 states. [2018-11-23 13:17:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:52,779 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 13:17:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:17:52,780 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:17:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:17:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:17:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:17:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:17:52,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2018-11-23 13:17:52,844 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 13:17:52,845 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:17:52,846 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:17:52,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:17:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:17:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 13:17:52,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:52,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 13:17:52,890 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:17:52,891 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:17:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:52,893 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:17:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:17:52,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:52,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:52,894 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:17:52,894 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:17:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:52,895 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:17:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:17:52,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:52,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:52,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:52,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:17:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 13:17:52,897 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2018-11-23 13:17:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:52,897 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 13:17:52,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:17:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:17:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:17:52,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:52,899 INFO L402 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:52,899 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:52,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash -884180732, now seen corresponding path program 6 times [2018-11-23 13:17:52,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:52,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:52,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:52,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:53,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2018-11-23 13:17:53,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2018-11-23 13:17:53,355 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #37#return; {2093#true} is VALID [2018-11-23 13:17:53,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {2093#true} call #t~ret1 := main(); {2093#true} is VALID [2018-11-23 13:17:53,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {2093#true} ~x~0 := 0; {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:53,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:53,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:53,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:53,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:53,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:53,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:53,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:53,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:53,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:53,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:53,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:53,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:53,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:53,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:53,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:53,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:53,370 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:53,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:53,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:53,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:53,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:53,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:53,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:53,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:53,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:53,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:53,378 INFO L273 TraceCheckUtils]: 31: Hoare triple {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:53,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:53,379 INFO L273 TraceCheckUtils]: 33: Hoare triple {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:53,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:53,381 INFO L273 TraceCheckUtils]: 35: Hoare triple {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:53,382 INFO L273 TraceCheckUtils]: 36: Hoare triple {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2111#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:53,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {2111#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {2094#false} is VALID [2018-11-23 13:17:53,383 INFO L256 TraceCheckUtils]: 38: Hoare triple {2094#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2094#false} is VALID [2018-11-23 13:17:53,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2018-11-23 13:17:53,384 INFO L273 TraceCheckUtils]: 40: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2018-11-23 13:17:53,384 INFO L273 TraceCheckUtils]: 41: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2018-11-23 13:17:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:53,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:53,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:17:53,563 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 13:17:53,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:53,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:53,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2018-11-23 13:17:53,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2018-11-23 13:17:53,803 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #37#return; {2093#true} is VALID [2018-11-23 13:17:53,803 INFO L256 TraceCheckUtils]: 3: Hoare triple {2093#true} call #t~ret1 := main(); {2093#true} is VALID [2018-11-23 13:17:53,803 INFO L273 TraceCheckUtils]: 4: Hoare triple {2093#true} ~x~0 := 0; {2093#true} is VALID [2018-11-23 13:17:53,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:17:53,807 INFO L273 TraceCheckUtils]: 31: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 100000000); {2093#true} is VALID [2018-11-23 13:17:53,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:17:53,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:17:53,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:17:53,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:17:53,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {2218#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2225#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} is VALID [2018-11-23 13:17:53,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {2225#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {2094#false} is VALID [2018-11-23 13:17:53,817 INFO L256 TraceCheckUtils]: 38: Hoare triple {2094#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2094#false} is VALID [2018-11-23 13:17:53,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2018-11-23 13:17:53,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2018-11-23 13:17:53,817 INFO L273 TraceCheckUtils]: 41: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2018-11-23 13:17:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 13:17:53,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2018-11-23 13:17:53,839 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:17:53,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:53,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:17:53,925 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 13:17:53,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:17:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:17:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:17:53,926 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 22 states. [2018-11-23 13:17:56,393 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-23 13:17:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:59,866 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-23 13:17:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:17:59,866 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:17:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:17:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2018-11-23 13:17:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:17:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2018-11-23 13:17:59,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 68 transitions. [2018-11-23 13:18:02,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:02,897 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:18:02,898 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:18:02,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:18:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:18:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 13:18:03,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:03,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 13:18:03,096 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 13:18:03,096 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 13:18:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:03,098 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-23 13:18:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-23 13:18:03,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:03,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:03,098 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 13:18:03,099 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 13:18:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:03,100 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-23 13:18:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-23 13:18:03,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:03,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:03,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:03,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:18:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-23 13:18:03,102 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 42 [2018-11-23 13:18:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:03,102 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-23 13:18:03,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:18:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 13:18:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:18:03,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:03,103 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:03,104 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:03,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1168417095, now seen corresponding path program 7 times [2018-11-23 13:18:03,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:03,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:04,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {2520#true} call ULTIMATE.init(); {2520#true} is VALID [2018-11-23 13:18:04,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {2520#true} assume true; {2520#true} is VALID [2018-11-23 13:18:04,163 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2520#true} {2520#true} #37#return; {2520#true} is VALID [2018-11-23 13:18:04,163 INFO L256 TraceCheckUtils]: 3: Hoare triple {2520#true} call #t~ret1 := main(); {2520#true} is VALID [2018-11-23 13:18:04,164 INFO L273 TraceCheckUtils]: 4: Hoare triple {2520#true} ~x~0 := 0; {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:04,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:04,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:04,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:04,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:04,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:04,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:04,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:04,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:04,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:04,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:04,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:04,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:04,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:04,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:04,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:04,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:04,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:04,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:04,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:04,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:04,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:04,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:04,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:04,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:04,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:04,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:04,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:04,187 INFO L273 TraceCheckUtils]: 32: Hoare triple {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:04,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:04,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:04,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:04,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:04,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:04,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2539#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:04,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {2539#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2539#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:04,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {2539#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2540#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:04,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {2540#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {2540#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:04,208 INFO L273 TraceCheckUtils]: 42: Hoare triple {2540#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2541#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:04,209 INFO L273 TraceCheckUtils]: 43: Hoare triple {2541#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {2521#false} is VALID [2018-11-23 13:18:04,209 INFO L256 TraceCheckUtils]: 44: Hoare triple {2521#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2521#false} is VALID [2018-11-23 13:18:04,210 INFO L273 TraceCheckUtils]: 45: Hoare triple {2521#false} ~cond := #in~cond; {2521#false} is VALID [2018-11-23 13:18:04,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {2521#false} assume 0 == ~cond; {2521#false} is VALID [2018-11-23 13:18:04,210 INFO L273 TraceCheckUtils]: 47: Hoare triple {2521#false} assume !false; {2521#false} is VALID [2018-11-23 13:18:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:04,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:04,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:04,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:04,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:04,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {2520#true} call ULTIMATE.init(); {2520#true} is VALID [2018-11-23 13:18:04,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {2520#true} assume true; {2520#true} is VALID [2018-11-23 13:18:04,613 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2520#true} {2520#true} #37#return; {2520#true} is VALID [2018-11-23 13:18:04,613 INFO L256 TraceCheckUtils]: 3: Hoare triple {2520#true} call #t~ret1 := main(); {2520#true} is VALID [2018-11-23 13:18:04,613 INFO L273 TraceCheckUtils]: 4: Hoare triple {2520#true} ~x~0 := 0; {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:04,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:04,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {2522#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:04,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:04,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {2523#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:04,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:04,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {2524#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:04,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:04,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {2525#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:04,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:04,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {2526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:04,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:04,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {2527#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:04,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:04,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {2528#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:04,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:04,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:04,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:04,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:04,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:04,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {2531#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:04,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:04,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {2532#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:04,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:04,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {2533#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:04,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:04,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {2534#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:04,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:04,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {2535#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:04,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:04,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {2536#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:04,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:04,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {2537#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:04,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:04,640 INFO L273 TraceCheckUtils]: 38: Hoare triple {2538#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2521#false} is VALID [2018-11-23 13:18:04,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {2521#false} assume !!(~x~0 % 4294967296 < 100000000); {2521#false} is VALID [2018-11-23 13:18:04,641 INFO L273 TraceCheckUtils]: 40: Hoare triple {2521#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2521#false} is VALID [2018-11-23 13:18:04,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {2521#false} assume !!(~x~0 % 4294967296 < 100000000); {2521#false} is VALID [2018-11-23 13:18:04,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {2521#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2521#false} is VALID [2018-11-23 13:18:04,641 INFO L273 TraceCheckUtils]: 43: Hoare triple {2521#false} assume !(~x~0 % 4294967296 < 100000000); {2521#false} is VALID [2018-11-23 13:18:04,642 INFO L256 TraceCheckUtils]: 44: Hoare triple {2521#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2521#false} is VALID [2018-11-23 13:18:04,642 INFO L273 TraceCheckUtils]: 45: Hoare triple {2521#false} ~cond := #in~cond; {2521#false} is VALID [2018-11-23 13:18:04,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {2521#false} assume 0 == ~cond; {2521#false} is VALID [2018-11-23 13:18:04,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {2521#false} assume !false; {2521#false} is VALID [2018-11-23 13:18:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 85 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:18:04,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:04,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 22 [2018-11-23 13:18:04,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:18:04,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:18:04,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:18:04,723 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 13:18:04,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:18:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:18:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:18:04,724 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 22 states. [2018-11-23 13:18:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:06,523 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 13:18:06,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:18:06,523 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:18:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:18:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:18:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:18:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:18:06,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2018-11-23 13:18:06,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:06,590 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:18:06,590 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:18:06,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:18:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:18:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 13:18:06,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:06,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 13:18:06,664 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:18:06,665 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:18:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:06,667 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 13:18:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 13:18:06,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:06,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:06,667 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:18:06,667 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:18:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:06,668 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-11-23 13:18:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 13:18:06,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:06,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:06,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:06,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:18:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-23 13:18:06,670 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 48 [2018-11-23 13:18:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:06,670 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-23 13:18:06,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:18:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-23 13:18:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:18:06,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:06,671 INFO L402 BasicCegarLoop]: trace histogram [21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:06,672 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:06,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash 652678003, now seen corresponding path program 8 times [2018-11-23 13:18:06,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:06,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:06,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:07,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {2971#true} call ULTIMATE.init(); {2971#true} is VALID [2018-11-23 13:18:07,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {2971#true} assume true; {2971#true} is VALID [2018-11-23 13:18:07,239 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2971#true} {2971#true} #37#return; {2971#true} is VALID [2018-11-23 13:18:07,240 INFO L256 TraceCheckUtils]: 3: Hoare triple {2971#true} call #t~ret1 := main(); {2971#true} is VALID [2018-11-23 13:18:07,240 INFO L273 TraceCheckUtils]: 4: Hoare triple {2971#true} ~x~0 := 0; {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:07,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:07,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:07,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:07,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:07,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:07,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:07,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:07,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:07,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:07,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:07,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:07,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:07,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:07,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:07,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:07,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:07,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:07,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:07,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:07,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:07,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:07,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:07,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:07,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:07,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:07,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:07,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:07,263 INFO L273 TraceCheckUtils]: 32: Hoare triple {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:07,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:07,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:07,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:07,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:07,267 INFO L273 TraceCheckUtils]: 37: Hoare triple {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:07,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:07,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:07,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:07,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:07,271 INFO L273 TraceCheckUtils]: 42: Hoare triple {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:07,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:07,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:07,273 INFO L273 TraceCheckUtils]: 45: Hoare triple {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:07,274 INFO L273 TraceCheckUtils]: 46: Hoare triple {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2994#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:07,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {2994#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {2972#false} is VALID [2018-11-23 13:18:07,275 INFO L256 TraceCheckUtils]: 48: Hoare triple {2972#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2972#false} is VALID [2018-11-23 13:18:07,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {2972#false} ~cond := #in~cond; {2972#false} is VALID [2018-11-23 13:18:07,276 INFO L273 TraceCheckUtils]: 50: Hoare triple {2972#false} assume 0 == ~cond; {2972#false} is VALID [2018-11-23 13:18:07,276 INFO L273 TraceCheckUtils]: 51: Hoare triple {2972#false} assume !false; {2972#false} is VALID [2018-11-23 13:18:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:07,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:07,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:07,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:18:07,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:18:07,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:07,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:07,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {2971#true} call ULTIMATE.init(); {2971#true} is VALID [2018-11-23 13:18:07,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {2971#true} assume true; {2971#true} is VALID [2018-11-23 13:18:07,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2971#true} {2971#true} #37#return; {2971#true} is VALID [2018-11-23 13:18:07,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {2971#true} call #t~ret1 := main(); {2971#true} is VALID [2018-11-23 13:18:07,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {2971#true} ~x~0 := 0; {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:07,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:07,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {2973#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:07,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:07,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {2974#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:07,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:07,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {2975#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:07,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:07,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {2976#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:07,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:07,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {2977#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:07,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:07,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {2978#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:07,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:07,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {2979#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:07,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:07,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {2980#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:07,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:07,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {2981#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:07,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:07,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {2982#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:07,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:07,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {2983#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:07,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:07,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {2984#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:07,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:07,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {2985#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:07,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:07,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {2986#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:07,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:07,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {2987#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:07,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:07,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {2988#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:07,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:07,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {2989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:07,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:07,594 INFO L273 TraceCheckUtils]: 40: Hoare triple {2990#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:07,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:07,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {2991#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:07,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:07,624 INFO L273 TraceCheckUtils]: 44: Hoare triple {2992#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:07,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:07,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {2993#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3136#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:07,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {3136#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2972#false} is VALID [2018-11-23 13:18:07,661 INFO L256 TraceCheckUtils]: 48: Hoare triple {2972#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2972#false} is VALID [2018-11-23 13:18:07,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {2972#false} ~cond := #in~cond; {2972#false} is VALID [2018-11-23 13:18:07,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {2972#false} assume 0 == ~cond; {2972#false} is VALID [2018-11-23 13:18:07,662 INFO L273 TraceCheckUtils]: 51: Hoare triple {2972#false} assume !false; {2972#false} is VALID [2018-11-23 13:18:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:07,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:07,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:18:07,704 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:18:07,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:18:07,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:18:08,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:08,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:18:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:18:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:18:08,096 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 25 states. [2018-11-23 13:18:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:10,694 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 13:18:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:18:10,695 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:18:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:18:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:18:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:18:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:18:10,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2018-11-23 13:18:10,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:10,775 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:18:10,775 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:18:10,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:18:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:18:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 13:18:10,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:10,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 13:18:10,892 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 13:18:10,893 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 13:18:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:10,894 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-11-23 13:18:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 13:18:10,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:10,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:10,895 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 13:18:10,895 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 13:18:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:10,896 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-11-23 13:18:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 13:18:10,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:10,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:10,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:10,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:18:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-11-23 13:18:10,897 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 52 [2018-11-23 13:18:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:10,898 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-11-23 13:18:10,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:18:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-23 13:18:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:18:10,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:10,898 INFO L402 BasicCegarLoop]: trace histogram [23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:10,899 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:10,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1219877677, now seen corresponding path program 9 times [2018-11-23 13:18:10,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:10,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:10,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:11,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2018-11-23 13:18:11,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {3457#true} assume true; {3457#true} is VALID [2018-11-23 13:18:11,649 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3457#true} {3457#true} #37#return; {3457#true} is VALID [2018-11-23 13:18:11,649 INFO L256 TraceCheckUtils]: 3: Hoare triple {3457#true} call #t~ret1 := main(); {3457#true} is VALID [2018-11-23 13:18:11,650 INFO L273 TraceCheckUtils]: 4: Hoare triple {3457#true} ~x~0 := 0; {3459#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:11,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {3459#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3459#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:11,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {3459#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3460#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:11,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {3460#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3460#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:11,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {3460#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3461#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:11,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {3461#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3461#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:11,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {3461#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3462#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:11,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {3462#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3462#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:11,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {3462#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3463#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:11,656 INFO L273 TraceCheckUtils]: 13: Hoare triple {3463#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {3463#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:11,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {3463#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3464#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:11,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {3464#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3464#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:11,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {3464#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3465#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:11,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {3465#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3465#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:11,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {3465#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3466#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:11,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {3466#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3466#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:11,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {3466#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3467#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:11,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {3467#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {3467#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:11,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {3467#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3468#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:11,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {3468#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {3468#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:11,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {3468#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:11,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:11,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3470#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:11,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {3470#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {3470#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:11,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {3470#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:11,669 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:11,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {3471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3472#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:11,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {3472#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3472#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:11,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {3472#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:11,672 INFO L273 TraceCheckUtils]: 33: Hoare triple {3473#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3473#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:11,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3474#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:11,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {3474#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {3474#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:11,675 INFO L273 TraceCheckUtils]: 36: Hoare triple {3474#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3475#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:11,675 INFO L273 TraceCheckUtils]: 37: Hoare triple {3475#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3475#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:11,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {3475#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3476#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:11,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {3476#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3476#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:11,678 INFO L273 TraceCheckUtils]: 40: Hoare triple {3476#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3477#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:11,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {3477#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3477#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:11,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {3477#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3478#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:11,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {3478#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3478#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:11,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {3478#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3479#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:11,682 INFO L273 TraceCheckUtils]: 45: Hoare triple {3479#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {3479#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:11,683 INFO L273 TraceCheckUtils]: 46: Hoare triple {3479#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3480#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:11,684 INFO L273 TraceCheckUtils]: 47: Hoare triple {3480#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3480#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:11,685 INFO L273 TraceCheckUtils]: 48: Hoare triple {3480#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:11,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {3481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:11,686 INFO L273 TraceCheckUtils]: 50: Hoare triple {3481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3482#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:11,687 INFO L273 TraceCheckUtils]: 51: Hoare triple {3482#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {3458#false} is VALID [2018-11-23 13:18:11,687 INFO L256 TraceCheckUtils]: 52: Hoare triple {3458#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3458#false} is VALID [2018-11-23 13:18:11,688 INFO L273 TraceCheckUtils]: 53: Hoare triple {3458#false} ~cond := #in~cond; {3458#false} is VALID [2018-11-23 13:18:11,688 INFO L273 TraceCheckUtils]: 54: Hoare triple {3458#false} assume 0 == ~cond; {3458#false} is VALID [2018-11-23 13:18:11,688 INFO L273 TraceCheckUtils]: 55: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2018-11-23 13:18:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:11,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:11,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:11,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:18:11,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 13:18:11,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:11,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:11,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2018-11-23 13:18:11,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {3457#true} assume true; {3457#true} is VALID [2018-11-23 13:18:11,914 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3457#true} {3457#true} #37#return; {3457#true} is VALID [2018-11-23 13:18:11,914 INFO L256 TraceCheckUtils]: 3: Hoare triple {3457#true} call #t~ret1 := main(); {3457#true} is VALID [2018-11-23 13:18:11,915 INFO L273 TraceCheckUtils]: 4: Hoare triple {3457#true} ~x~0 := 0; {3457#true} is VALID [2018-11-23 13:18:11,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 25: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 27: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 35: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 37: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3457#true} is VALID [2018-11-23 13:18:11,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {3457#true} assume !!(~x~0 % 4294967296 < 100000000); {3457#true} is VALID [2018-11-23 13:18:11,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {3457#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3618#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:18:11,921 INFO L273 TraceCheckUtils]: 45: Hoare triple {3618#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3618#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:18:11,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {3618#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3625#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:18:11,960 INFO L273 TraceCheckUtils]: 47: Hoare triple {3625#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3625#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:18:11,975 INFO L273 TraceCheckUtils]: 48: Hoare triple {3625#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3632#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} is VALID [2018-11-23 13:18:11,984 INFO L273 TraceCheckUtils]: 49: Hoare triple {3632#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3632#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} is VALID [2018-11-23 13:18:11,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {3632#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3639#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2018-11-23 13:18:12,008 INFO L273 TraceCheckUtils]: 51: Hoare triple {3639#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {3458#false} is VALID [2018-11-23 13:18:12,008 INFO L256 TraceCheckUtils]: 52: Hoare triple {3458#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3458#false} is VALID [2018-11-23 13:18:12,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {3458#false} ~cond := #in~cond; {3458#false} is VALID [2018-11-23 13:18:12,009 INFO L273 TraceCheckUtils]: 54: Hoare triple {3458#false} assume 0 == ~cond; {3458#false} is VALID [2018-11-23 13:18:12,009 INFO L273 TraceCheckUtils]: 55: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2018-11-23 13:18:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 140 proven. 9 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-23 13:18:12,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:12,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6] total 30 [2018-11-23 13:18:12,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:18:12,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:18:12,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:18:12,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:12,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:18:12,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:18:12,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:18:12,122 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 30 states. [2018-11-23 13:18:17,812 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-23 13:18:24,445 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-23 13:18:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:41,424 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-23 13:18:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:18:41,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:18:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:18:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 86 transitions. [2018-11-23 13:18:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:18:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 86 transitions. [2018-11-23 13:18:41,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 86 transitions. [2018-11-23 13:18:42,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:42,650 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:18:42,650 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:18:42,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=272, Invalid=917, Unknown=1, NotChecked=0, Total=1190 [2018-11-23 13:18:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:18:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-11-23 13:18:42,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:42,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 63 states. [2018-11-23 13:18:42,737 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 63 states. [2018-11-23 13:18:42,737 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 63 states. [2018-11-23 13:18:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:42,740 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-11-23 13:18:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-23 13:18:42,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:42,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:42,741 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 68 states. [2018-11-23 13:18:42,741 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 68 states. [2018-11-23 13:18:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:42,742 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-11-23 13:18:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-23 13:18:42,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:42,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:42,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:42,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:18:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 13:18:42,745 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 56 [2018-11-23 13:18:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:42,745 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 13:18:42,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:18:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 13:18:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:18:42,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:42,746 INFO L402 BasicCegarLoop]: trace histogram [26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:42,746 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:42,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1395503838, now seen corresponding path program 10 times [2018-11-23 13:18:42,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {4021#true} call ULTIMATE.init(); {4021#true} is VALID [2018-11-23 13:18:44,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {4021#true} assume true; {4021#true} is VALID [2018-11-23 13:18:44,104 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4021#true} {4021#true} #37#return; {4021#true} is VALID [2018-11-23 13:18:44,105 INFO L256 TraceCheckUtils]: 3: Hoare triple {4021#true} call #t~ret1 := main(); {4021#true} is VALID [2018-11-23 13:18:44,105 INFO L273 TraceCheckUtils]: 4: Hoare triple {4021#true} ~x~0 := 0; {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:44,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:44,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:44,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:44,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:44,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:44,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:44,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:44,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:44,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:44,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:44,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:44,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:44,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:44,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:44,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:44,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:44,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:44,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:44,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:44,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:44,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:44,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:44,123 INFO L273 TraceCheckUtils]: 27: Hoare triple {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:44,124 INFO L273 TraceCheckUtils]: 28: Hoare triple {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:44,125 INFO L273 TraceCheckUtils]: 29: Hoare triple {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:44,126 INFO L273 TraceCheckUtils]: 30: Hoare triple {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:44,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:44,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:44,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:44,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:44,130 INFO L273 TraceCheckUtils]: 35: Hoare triple {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:44,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:44,131 INFO L273 TraceCheckUtils]: 37: Hoare triple {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:44,132 INFO L273 TraceCheckUtils]: 38: Hoare triple {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:44,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:44,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:44,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:44,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:44,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:44,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:44,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:44,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:44,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:44,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:44,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:44,142 INFO L273 TraceCheckUtils]: 50: Hoare triple {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:44,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {4046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:44,144 INFO L273 TraceCheckUtils]: 52: Hoare triple {4046#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:44,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {4047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:44,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {4047#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4048#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:44,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {4048#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < 100000000); {4048#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:44,147 INFO L273 TraceCheckUtils]: 56: Hoare triple {4048#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4022#false} is VALID [2018-11-23 13:18:44,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {4022#false} assume !(~x~0 % 4294967296 < 100000000); {4022#false} is VALID [2018-11-23 13:18:44,148 INFO L256 TraceCheckUtils]: 58: Hoare triple {4022#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {4022#false} is VALID [2018-11-23 13:18:44,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {4022#false} ~cond := #in~cond; {4022#false} is VALID [2018-11-23 13:18:44,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {4022#false} assume 0 == ~cond; {4022#false} is VALID [2018-11-23 13:18:44,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {4022#false} assume !false; {4022#false} is VALID [2018-11-23 13:18:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:44,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:44,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:44,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:18:44,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:18:44,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:44,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {4021#true} call ULTIMATE.init(); {4021#true} is VALID [2018-11-23 13:18:44,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {4021#true} assume true; {4021#true} is VALID [2018-11-23 13:18:44,528 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4021#true} {4021#true} #37#return; {4021#true} is VALID [2018-11-23 13:18:44,529 INFO L256 TraceCheckUtils]: 3: Hoare triple {4021#true} call #t~ret1 := main(); {4021#true} is VALID [2018-11-23 13:18:44,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {4021#true} ~x~0 := 0; {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:44,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:44,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {4023#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:44,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:44,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {4024#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:44,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:44,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {4025#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:44,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:44,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {4026#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:44,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:44,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {4027#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:44,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:44,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {4028#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:44,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:44,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:44,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:44,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {4030#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:44,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:44,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {4031#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:44,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:44,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {4032#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:44,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:44,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {4033#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:44,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:44,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {4034#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:44,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:44,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {4035#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:44,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:44,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {4036#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:44,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:44,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {4037#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:44,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:44,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {4038#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:44,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:44,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {4039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:44,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:44,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {4040#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:44,558 INFO L273 TraceCheckUtils]: 41: Hoare triple {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:44,559 INFO L273 TraceCheckUtils]: 42: Hoare triple {4041#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:44,559 INFO L273 TraceCheckUtils]: 43: Hoare triple {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:44,560 INFO L273 TraceCheckUtils]: 44: Hoare triple {4042#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:44,561 INFO L273 TraceCheckUtils]: 45: Hoare triple {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:44,562 INFO L273 TraceCheckUtils]: 46: Hoare triple {4043#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:44,563 INFO L273 TraceCheckUtils]: 47: Hoare triple {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:44,564 INFO L273 TraceCheckUtils]: 48: Hoare triple {4044#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:44,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:44,565 INFO L273 TraceCheckUtils]: 50: Hoare triple {4045#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4022#false} is VALID [2018-11-23 13:18:44,565 INFO L273 TraceCheckUtils]: 51: Hoare triple {4022#false} assume !!(~x~0 % 4294967296 < 100000000); {4022#false} is VALID [2018-11-23 13:18:44,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {4022#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4022#false} is VALID [2018-11-23 13:18:44,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {4022#false} assume !!(~x~0 % 4294967296 < 100000000); {4022#false} is VALID [2018-11-23 13:18:44,566 INFO L273 TraceCheckUtils]: 54: Hoare triple {4022#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4022#false} is VALID [2018-11-23 13:18:44,566 INFO L273 TraceCheckUtils]: 55: Hoare triple {4022#false} assume !!(~x~0 % 4294967296 < 100000000); {4022#false} is VALID [2018-11-23 13:18:44,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {4022#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4022#false} is VALID [2018-11-23 13:18:44,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {4022#false} assume !(~x~0 % 4294967296 < 100000000); {4022#false} is VALID [2018-11-23 13:18:44,567 INFO L256 TraceCheckUtils]: 58: Hoare triple {4022#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {4022#false} is VALID [2018-11-23 13:18:44,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {4022#false} ~cond := #in~cond; {4022#false} is VALID [2018-11-23 13:18:44,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {4022#false} assume 0 == ~cond; {4022#false} is VALID [2018-11-23 13:18:44,567 INFO L273 TraceCheckUtils]: 61: Hoare triple {4022#false} assume !false; {4022#false} is VALID [2018-11-23 13:18:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 161 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:18:44,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:44,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 28 [2018-11-23 13:18:44,595 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-11-23 13:18:44,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:18:44,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:18:44,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:44,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:18:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:18:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:18:44,677 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 28 states. [2018-11-23 13:18:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:47,812 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 13:18:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:18:47,812 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-11-23 13:18:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:18:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:18:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:18:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:18:47,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2018-11-23 13:18:47,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:47,914 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:18:47,915 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:18:47,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:18:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:18:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:18:48,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:48,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:48,001 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:48,001 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:48,003 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:18:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:18:48,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:48,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:48,004 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:48,004 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:48,006 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:18:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:18:48,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:48,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:48,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:48,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:18:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 13:18:48,009 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 62 [2018-11-23 13:18:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:48,009 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 13:18:48,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:18:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:18:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:18:48,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:48,010 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:48,010 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:48,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:48,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1514026076, now seen corresponding path program 11 times [2018-11-23 13:18:48,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:48,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:48,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:49,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {4593#true} call ULTIMATE.init(); {4593#true} is VALID [2018-11-23 13:18:49,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {4593#true} assume true; {4593#true} is VALID [2018-11-23 13:18:49,356 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4593#true} {4593#true} #37#return; {4593#true} is VALID [2018-11-23 13:18:49,356 INFO L256 TraceCheckUtils]: 3: Hoare triple {4593#true} call #t~ret1 := main(); {4593#true} is VALID [2018-11-23 13:18:49,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {4593#true} ~x~0 := 0; {4595#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:49,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {4595#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4595#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:49,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {4595#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4596#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:49,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {4596#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4596#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:49,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {4596#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4597#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:49,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {4597#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4597#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:49,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {4597#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4598#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:49,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4598#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:49,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {4598#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4599#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:49,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {4599#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {4599#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:49,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {4599#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4600#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:49,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {4600#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4600#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:49,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {4600#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:49,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:49,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4602#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:49,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {4602#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4602#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:49,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {4602#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4603#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:49,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {4603#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {4603#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:49,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {4603#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4604#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:49,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {4604#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {4604#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:49,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {4604#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4605#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:49,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {4605#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4605#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:49,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {4605#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4606#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:49,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {4606#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {4606#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:49,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {4606#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4607#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:49,378 INFO L273 TraceCheckUtils]: 29: Hoare triple {4607#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4607#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:49,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {4607#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4608#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:49,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {4608#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4608#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:49,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {4608#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4609#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:49,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {4609#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4609#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:49,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {4609#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4610#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:49,383 INFO L273 TraceCheckUtils]: 35: Hoare triple {4610#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {4610#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:49,384 INFO L273 TraceCheckUtils]: 36: Hoare triple {4610#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4611#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:49,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {4611#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4611#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:49,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {4611#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4612#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:49,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {4612#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4612#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:49,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {4612#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:49,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:49,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4614#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:49,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {4614#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4614#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:49,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {4614#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4615#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:49,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {4615#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {4615#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:49,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {4615#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4616#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:49,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {4616#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {4616#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:49,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {4616#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4617#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:49,395 INFO L273 TraceCheckUtils]: 49: Hoare triple {4617#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4617#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:49,396 INFO L273 TraceCheckUtils]: 50: Hoare triple {4617#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4618#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:49,396 INFO L273 TraceCheckUtils]: 51: Hoare triple {4618#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4618#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:49,397 INFO L273 TraceCheckUtils]: 52: Hoare triple {4618#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4619#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:49,398 INFO L273 TraceCheckUtils]: 53: Hoare triple {4619#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4619#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:49,399 INFO L273 TraceCheckUtils]: 54: Hoare triple {4619#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4620#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:49,400 INFO L273 TraceCheckUtils]: 55: Hoare triple {4620#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4620#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:49,401 INFO L273 TraceCheckUtils]: 56: Hoare triple {4620#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4621#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:18:49,401 INFO L273 TraceCheckUtils]: 57: Hoare triple {4621#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4621#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:18:49,403 INFO L273 TraceCheckUtils]: 58: Hoare triple {4621#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4622#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:49,403 INFO L273 TraceCheckUtils]: 59: Hoare triple {4622#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < 100000000); {4622#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:49,404 INFO L273 TraceCheckUtils]: 60: Hoare triple {4622#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4594#false} is VALID [2018-11-23 13:18:49,405 INFO L273 TraceCheckUtils]: 61: Hoare triple {4594#false} assume !(~x~0 % 4294967296 < 100000000); {4594#false} is VALID [2018-11-23 13:18:49,405 INFO L256 TraceCheckUtils]: 62: Hoare triple {4594#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {4594#false} is VALID [2018-11-23 13:18:49,405 INFO L273 TraceCheckUtils]: 63: Hoare triple {4594#false} ~cond := #in~cond; {4594#false} is VALID [2018-11-23 13:18:49,405 INFO L273 TraceCheckUtils]: 64: Hoare triple {4594#false} assume 0 == ~cond; {4594#false} is VALID [2018-11-23 13:18:49,405 INFO L273 TraceCheckUtils]: 65: Hoare triple {4594#false} assume !false; {4594#false} is VALID [2018-11-23 13:18:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:49,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:49,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1