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/loop-acceleration/phases_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:08,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:08,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:08,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:08,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:08,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:08,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:08,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:08,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:08,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:08,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:08,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:08,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:08,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:08,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:08,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:08,451 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:08,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:08,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:08,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:08,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:08,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:08,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:08,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:08,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:08,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:08,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:08,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:08,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:08,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:08,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:08,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:08,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:08,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:08,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:08,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:08,477 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:08:08,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:08,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:08,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:08,508 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:08,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:08,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:08,509 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:08,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:08,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:08,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:08,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:08,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:08,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:08,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:08,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:08,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:08,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:08,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:08,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:08,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:08,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:08,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:08,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:08,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:08,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:08,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:08,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:08,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:08,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:08,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:08,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:08,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:08,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:08,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:08,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:08,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:08,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call1.i [2018-11-23 13:08:08,643 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909bbe346/7d43c7c4be0146d6b8ad4104764b6860/FLAGdbba6f04b [2018-11-23 13:08:09,098 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:09,098 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call1.i [2018-11-23 13:08:09,104 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909bbe346/7d43c7c4be0146d6b8ad4104764b6860/FLAGdbba6f04b [2018-11-23 13:08:09,462 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909bbe346/7d43c7c4be0146d6b8ad4104764b6860 [2018-11-23 13:08:09,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:09,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:09,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:09,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:09,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:09,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7fdbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09, skipping insertion in model container [2018-11-23 13:08:09,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:09,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:09,698 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:09,702 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:09,720 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:09,736 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:09,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09 WrapperNode [2018-11-23 13:08:09,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:09,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:09,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:09,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:09,748 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:08:09" (1/1) ... [2018-11-23 13:08:09,754 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:08:09" (1/1) ... [2018-11-23 13:08:09,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:09,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:09,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:09,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:09,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (1/1) ... [2018-11-23 13:08:09,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:09,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:09,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:09,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:09,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (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:08:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:09,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:09,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:09,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:10,390 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:10,390 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:08:10,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:10 BoogieIcfgContainer [2018-11-23 13:08:10,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:10,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:10,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:10,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:10,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:09" (1/3) ... [2018-11-23 13:08:10,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125dc6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:10, skipping insertion in model container [2018-11-23 13:08:10,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:09" (2/3) ... [2018-11-23 13:08:10,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125dc6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:10, skipping insertion in model container [2018-11-23 13:08:10,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:10" (3/3) ... [2018-11-23 13:08:10,399 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call1.i [2018-11-23 13:08:10,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:10,417 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:10,435 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:10,478 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:10,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:10,479 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:10,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:10,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:10,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:10,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:10,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:10,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:08:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:08:10,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:10,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:10,512 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:10,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:08:10,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:10,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:08:10,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:08:10,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 13:08:10,662 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 13:08:10,662 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2018-11-23 13:08:10,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:08:10,664 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-23 13:08:10,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:08:10,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:08:10,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:08:10,668 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:08:10,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:10,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:08:10,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:08:10,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:10,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:08:10,752 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:08:10,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:08:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:08:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:08:10,764 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:08:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:10,837 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:08:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:08:10,838 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:08:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:08:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:08:10,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 13:08:11,035 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:08:11,046 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:08:11,046 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:08:11,050 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:08:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:08:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:08:11,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:11,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:11,171 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:11,172 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:11,179 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:08:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:08:11,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:11,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:11,180 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:11,180 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:11,185 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:08:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:08:11,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:11,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:11,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:11,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:08:11,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 13:08:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:11,193 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:08:11,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:08:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:08:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:08:11,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:11,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:11,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:11,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 13:08:11,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:11,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:11,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:11,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:11,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:08:11,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:08:11,448 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #37#return; {106#true} is VALID [2018-11-23 13:08:11,448 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-23 13:08:11,463 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:08:11,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {107#false} is VALID [2018-11-23 13:08:11,464 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {107#false} is VALID [2018-11-23 13:08:11,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:08:11,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:08:11,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:08:11,466 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:08:11,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:11,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:11,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:11,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:11,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:11,500 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:08:11,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:11,501 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 13:08:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:11,620 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:08:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:11,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:08:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:08:11,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 13:08:11,762 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:08:11,764 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:08:11,764 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:08:11,767 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:08:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:08:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:08:11,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:11,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:11,778 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:11,779 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:11,780 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:08:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:08:11,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:11,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:11,781 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:11,781 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:11,783 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:08:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:08:11,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:11,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:11,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:11,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:08:11,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:08:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:11,786 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:08:11,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:08:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:08:11,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:11,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:11,787 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:11,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 13:08:11,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:11,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:11,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:11,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:11,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:08:11,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:08:11,936 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:08:11,936 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:08:11,937 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:08:11,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:11,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:11,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {194#false} is VALID [2018-11-23 13:08:11,949 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {194#false} is VALID [2018-11-23 13:08:11,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:08:11,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:08:11,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:08:11,951 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:08:11,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:11,952 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:08:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:12,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:08:12,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:08:12,415 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:08:12,415 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:08:12,424 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:08:12,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:12,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:12,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {194#false} is VALID [2018-11-23 13:08:12,464 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {194#false} is VALID [2018-11-23 13:08:12,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:08:12,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:08:12,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:08:12,466 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:08:12,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:12,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:08:12,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:08:12,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:12,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:08:12,566 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:08:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:08:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:08:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:12,568 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 13:08:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:12,809 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:08:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:08:12,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:08:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:08:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:08:12,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-23 13:08:12,855 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:08:12,856 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:08:12,857 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:08:12,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:08:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:08:12,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:12,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:12,874 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:12,875 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:12,877 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:08:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:08:12,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:12,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:12,878 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:12,879 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:12,881 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:08:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:08:12,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:12,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:12,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:12,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:08:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:08:12,885 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 13:08:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:12,885 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:08:12,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:08:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:08:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:08:12,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:12,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:12,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:12,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2018-11-23 13:08:12,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:13,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:08:13,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:08:13,104 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:08:13,105 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:08:13,105 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:08:13,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:13,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:13,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:13,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:13,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {326#false} is VALID [2018-11-23 13:08:13,115 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {326#false} is VALID [2018-11-23 13:08:13,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:08:13,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:08:13,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:08:13,117 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:08:13,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:13,117 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:08:13,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:13,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:13,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:13,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:13,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:08:13,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:08:13,276 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:08:13,277 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:08:13,278 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:08:13,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:13,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:13,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:13,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:13,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {326#false} is VALID [2018-11-23 13:08:13,346 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {326#false} is VALID [2018-11-23 13:08:13,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:08:13,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:08:13,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:08:13,348 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:08:13,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:13,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:08:13,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:08:13,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:13,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:08:13,403 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:08:13,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:08:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:08:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:13,404 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2018-11-23 13:08:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:13,597 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:08:13,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:08:13,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:08:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:08:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:08:13,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2018-11-23 13:08:13,687 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:08:13,689 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:08:13,689 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:08:13,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 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:08:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:08:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:08:13,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:13,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:13,705 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:13,705 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:13,707 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:08:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:08:13,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:13,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:13,708 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:13,708 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:13,710 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:08:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:08:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:13,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:13,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:13,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:08:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:08:13,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 13:08:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:13,713 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:08:13,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:08:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:08:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:08:13,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:13,714 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:13,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2018-11-23 13:08:13,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:13,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:13,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:14,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:08:14,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:08:14,120 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:08:14,120 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:08:14,121 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:08:14,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:14,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:14,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:14,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:14,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:14,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:14,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {475#false} is VALID [2018-11-23 13:08:14,157 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {475#false} is VALID [2018-11-23 13:08:14,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:08:14,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:08:14,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:08:14,159 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:08:14,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:14,159 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:08:14,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:14,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:08:14,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:14,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:14,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:08:14,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:08:14,234 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:08:14,234 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:08:14,235 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {474#true} is VALID [2018-11-23 13:08:14,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 268435455); {474#true} is VALID [2018-11-23 13:08:14,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {474#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:08:14,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 268435455); {474#true} is VALID [2018-11-23 13:08:14,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:08:14,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 268435455); {474#true} is VALID [2018-11-23 13:08:14,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {474#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:08:14,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {475#false} is VALID [2018-11-23 13:08:14,238 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {475#false} is VALID [2018-11-23 13:08:14,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:08:14,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:08:14,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:08:14,240 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:08:14,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:08:14,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 13:08:14,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:08:14,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:14,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:08:14,300 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:08:14,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:08:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:08:14,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:08:14,301 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2018-11-23 13:08:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:16,547 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 13:08:16,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:08:16,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:08:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:08:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:08:16,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 13:08:16,611 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:08:16,613 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:08:16,614 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:08:16,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:08:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:08:16,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:16,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:08:16,642 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:08:16,642 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:08:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:16,644 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:08:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:08:16,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:16,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:16,645 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:08:16,645 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:08:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:16,647 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:08:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:08:16,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:16,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:16,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:16,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 13:08:16,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-23 13:08:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:16,650 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 13:08:16,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:08:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 13:08:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:08:16,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:16,651 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:16,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:16,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1988642215, now seen corresponding path program 1 times [2018-11-23 13:08:16,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:16,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:16,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:16,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:16,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:16,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:08:16,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:08:16,957 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:08:16,958 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:08:16,962 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:08:16,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:16,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:16,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:16,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:16,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:16,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:16,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:16,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:16,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:16,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:16,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {652#false} is VALID [2018-11-23 13:08:16,975 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {652#false} is VALID [2018-11-23 13:08:16,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:08:16,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:08:16,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:08:16,979 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:08:16,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:16,980 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:08:16,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:17,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:17,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:08:17,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:08:17,197 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:08:17,198 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:08:17,201 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:08:17,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:17,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:17,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:17,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:17,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:17,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:17,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:17,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:17,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:17,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {652#false} is VALID [2018-11-23 13:08:17,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#false} assume !(~x~0 % 4294967296 < 268435455); {652#false} is VALID [2018-11-23 13:08:17,226 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {652#false} is VALID [2018-11-23 13:08:17,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:08:17,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:08:17,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:08:17,228 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:08:17,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:17,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-23 13:08:17,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:08:17,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:17,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:08:17,296 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:08:17,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:08:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:08:17,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:17,297 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-11-23 13:08:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:17,713 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:08:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:08:17,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:08:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:08:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:08:17,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2018-11-23 13:08:17,781 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:08:17,782 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:08:17,782 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:08:17,783 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:08:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:08:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:08:17,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:17,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:08:17,876 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:08:17,876 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:08:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:17,877 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:08:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:08:17,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:17,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:17,878 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:08:17,881 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:08:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:17,883 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:08:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:08:17,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:17,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:17,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:17,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 13:08:17,886 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-11-23 13:08:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:17,887 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 13:08:17,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:08:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:08:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:08:17,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:17,888 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:17,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:17,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1105955487, now seen corresponding path program 2 times [2018-11-23 13:08:17,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:17,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:17,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:17,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:18,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:08:18,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:08:18,514 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:08:18,514 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:08:18,515 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:08:18,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:18,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:18,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:18,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:18,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:18,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:18,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:18,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:18,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:18,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:08:18,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:18,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:08:18,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:18,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:18,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {859#false} is VALID [2018-11-23 13:08:18,536 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {859#false} is VALID [2018-11-23 13:08:18,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:08:18,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:08:18,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:08:18,540 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:08:18,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:18,540 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:08:18,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:18,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:18,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:18,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:18,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:08:18,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:08:18,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:08:18,742 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:08:18,743 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:08:18,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:18,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:18,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:18,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:18,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:18,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:18,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:18,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:18,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:18,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:08:18,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:18,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:08:18,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:18,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:18,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {859#false} is VALID [2018-11-23 13:08:18,759 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {859#false} is VALID [2018-11-23 13:08:18,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:08:18,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:08:18,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:08:18,762 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:08:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:08:18,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:08:18,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:18,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:08:18,828 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:08:18,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:08:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:08:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:18,829 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-23 13:08:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:19,324 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:08:19,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:08:19,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:08:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:08:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:08:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:08:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:08:19,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 13:08:19,401 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:08:19,403 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:08:19,406 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:08:19,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:08:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:08:19,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:19,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:19,441 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:19,441 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:19,443 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:08:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:08:19,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:19,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:19,444 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:19,445 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:19,446 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:08:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:08:19,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:19,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:19,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:19,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:08:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 13:08:19,449 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-23 13:08:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:19,450 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 13:08:19,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:08:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:08:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:08:19,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:19,451 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:19,451 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:19,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 3029019, now seen corresponding path program 3 times [2018-11-23 13:08:19,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:19,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:19,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:19,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:08:19,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:08:19,782 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:08:19,782 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:08:19,783 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:08:19,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:19,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:19,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:19,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:19,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:19,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:19,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:19,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:19,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:19,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:08:19,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:19,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:08:19,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:19,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:19,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:08:19,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:19,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:19,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:19,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1101#false} is VALID [2018-11-23 13:08:19,807 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1101#false} is VALID [2018-11-23 13:08:19,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:08:19,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:08:19,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:08:19,811 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:08:19,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:19,811 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:08:19,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:19,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:08:19,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:19,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:19,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:08:19,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:08:19,938 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:08:19,938 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:08:19,939 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1100#true} is VALID [2018-11-23 13:08:19,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:08:19,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 268435455); {1100#true} is VALID [2018-11-23 13:08:19,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:08:19,943 INFO L273 TraceCheckUtils]: 21: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:08:19,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1182#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-23 13:08:19,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {1182#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {1101#false} is VALID [2018-11-23 13:08:19,945 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1101#false} is VALID [2018-11-23 13:08:19,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:08:19,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:08:19,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:08:19,948 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:08:19,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:19,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-11-23 13:08:19,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:08:19,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:19,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:08:20,047 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:08:20,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:08:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:08:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:08:20,048 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-11-23 13:08:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:24,519 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 13:08:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:08:24,519 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:08:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-23 13:08:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2018-11-23 13:08:24,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 53 transitions. [2018-11-23 13:08:24,882 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:08:24,883 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:08:24,883 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:08:24,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:08:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:08:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-23 13:08:24,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:24,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-23 13:08:24,910 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-23 13:08:24,910 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-23 13:08:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:24,913 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:08:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:08:24,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:24,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:24,914 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-23 13:08:24,914 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-23 13:08:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:24,916 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:08:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:08:24,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:24,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:24,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:24,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:08:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 13:08:24,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-11-23 13:08:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:24,919 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 13:08:24,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:08:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:08:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:08:24,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:24,920 INFO L402 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:24,921 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:24,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1686757776, now seen corresponding path program 4 times [2018-11-23 13:08:24,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:24,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:24,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:24,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:24,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:25,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-23 13:08:25,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-23 13:08:25,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #37#return; {1401#true} is VALID [2018-11-23 13:08:25,479 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret1 := main(); {1401#true} is VALID [2018-11-23 13:08:25,480 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:08:25,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:25,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:25,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:25,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:25,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:25,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:25,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:08:25,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:25,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:08:25,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:25,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:08:25,560 INFO L273 TraceCheckUtils]: 20: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:25,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#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:08:25,597 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:08:25,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#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:08:25,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:25,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:25,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:25,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {1414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1415#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:25,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {1415#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1402#false} is VALID [2018-11-23 13:08:25,658 INFO L256 TraceCheckUtils]: 30: Hoare triple {1402#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1402#false} is VALID [2018-11-23 13:08:25,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-23 13:08:25,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-23 13:08:25,659 INFO L273 TraceCheckUtils]: 33: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-23 13:08:25,661 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:08:25,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:25,661 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:08:25,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:25,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:25,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:25,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:25,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-23 13:08:25,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-23 13:08:25,837 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #37#return; {1401#true} is VALID [2018-11-23 13:08:25,837 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret1 := main(); {1401#true} is VALID [2018-11-23 13:08:25,838 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:08:25,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:25,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:25,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:25,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:25,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:25,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:25,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:08:25,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:25,848 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:08:25,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:25,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:08:25,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {1410#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:25,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:25,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#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:08:25,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:08:25,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#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:08:25,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:25,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1402#false} is VALID [2018-11-23 13:08:25,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {1402#false} assume !!(~x~0 % 4294967296 < 268435455); {1402#false} is VALID [2018-11-23 13:08:25,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1402#false} is VALID [2018-11-23 13:08:25,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < 268435455); {1402#false} is VALID [2018-11-23 13:08:25,858 INFO L256 TraceCheckUtils]: 30: Hoare triple {1402#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1402#false} is VALID [2018-11-23 13:08:25,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-23 13:08:25,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-23 13:08:25,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-23 13:08:25,860 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:08:25,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:25,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 15 [2018-11-23 13:08:25,890 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:08:25,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:25,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:08:25,957 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:08:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:08:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:08:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:08:25,958 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 15 states. [2018-11-23 13:08:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,883 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 13:08:26,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:08:26,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:08:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:08:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:08:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:08:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:08:26,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2018-11-23 13:08:27,158 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:08:27,160 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:08:27,160 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:08:27,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:08:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:08:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:08:27,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:27,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 13:08:27,202 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:08:27,202 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:08:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,205 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:08:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:08:27,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:27,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:27,206 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:08:27,206 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:08:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,208 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:08:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:08:27,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:27,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:27,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:27,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:08:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 13:08:27,210 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-11-23 13:08:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:27,210 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:08:27,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:08:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:08:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:08:27,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:27,212 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:27,212 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:27,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash 419627978, now seen corresponding path program 5 times [2018-11-23 13:08:27,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:27,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:27,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:27,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2018-11-23 13:08:27,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2018-11-23 13:08:27,759 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #37#return; {1730#true} is VALID [2018-11-23 13:08:27,760 INFO L256 TraceCheckUtils]: 3: Hoare triple {1730#true} call #t~ret1 := main(); {1730#true} is VALID [2018-11-23 13:08:27,761 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:08:27,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:27,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:27,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:27,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:27,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:27,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:08:27,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:27,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:27,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:27,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:08:27,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:27,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:08:27,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:27,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:27,775 INFO L273 TraceCheckUtils]: 19: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:08:27,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:27,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:27,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#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:08:27,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:08:27,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#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:08:27,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:27,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:08:27,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:08:27,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#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:08:27,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:27,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:27,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:27,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {1745#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1746#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:27,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {1746#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1731#false} is VALID [2018-11-23 13:08:27,801 INFO L256 TraceCheckUtils]: 34: Hoare triple {1731#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1731#false} is VALID [2018-11-23 13:08:27,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {1731#false} ~cond := #in~cond; {1731#false} is VALID [2018-11-23 13:08:27,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {1731#false} assume 0 == ~cond; {1731#false} is VALID [2018-11-23 13:08:27,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2018-11-23 13:08:27,806 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:08:27,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:27,806 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:08:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:09:46,922 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-23 13:09:46,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:46,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:47,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2018-11-23 13:09:47,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2018-11-23 13:09:47,398 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #37#return; {1730#true} is VALID [2018-11-23 13:09:47,398 INFO L256 TraceCheckUtils]: 3: Hoare triple {1730#true} call #t~ret1 := main(); {1730#true} is VALID [2018-11-23 13:09:47,399 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:09:47,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:47,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {1732#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:47,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:47,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {1733#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:47,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:47,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:09:47,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:47,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {1735#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:47,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:47,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {1736#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:09:47,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:47,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {1737#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:09:47,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:47,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {1738#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:47,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:47,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {1739#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:47,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:47,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {1740#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#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:09:47,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:47,420 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#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:09:47,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:47,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:47,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:47,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {1743#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#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:09:47,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:47,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1731#false} is VALID [2018-11-23 13:09:47,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {1731#false} assume !!(~x~0 % 4294967296 < 268435455); {1731#false} is VALID [2018-11-23 13:09:47,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {1731#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1731#false} is VALID [2018-11-23 13:09:47,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {1731#false} assume !(~x~0 % 4294967296 < 268435455); {1731#false} is VALID [2018-11-23 13:09:47,431 INFO L256 TraceCheckUtils]: 34: Hoare triple {1731#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1731#false} is VALID [2018-11-23 13:09:47,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {1731#false} ~cond := #in~cond; {1731#false} is VALID [2018-11-23 13:09:47,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {1731#false} assume 0 == ~cond; {1731#false} is VALID [2018-11-23 13:09:47,432 INFO L273 TraceCheckUtils]: 37: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2018-11-23 13:09:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:09:47,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:47,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 17 [2018-11-23 13:09:47,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:09:47,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:47,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:09:47,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:47,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:09:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:09:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:09:47,496 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 17 states. [2018-11-23 13:09:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:48,758 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 13:09:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:09:48,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:09:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:09:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:09:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:09:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:09:48,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2018-11-23 13:09:48,833 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:09:48,835 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:09:48,835 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:09:48,836 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:09:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:09:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 13:09:48,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:48,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 13:09:48,881 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:09:48,881 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:09:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:48,882 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:09:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:09:48,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:48,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:48,883 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 13:09:48,883 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 13:09:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:48,885 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:09:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:09:48,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:48,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:48,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:48,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:09:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 13:09:48,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2018-11-23 13:09:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:48,887 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 13:09:48,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:09:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:09:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:09:48,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:48,888 INFO L402 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:48,889 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:48,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash -884180732, now seen corresponding path program 6 times [2018-11-23 13:09:48,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:48,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:48,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:48,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:48,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:49,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2018-11-23 13:09:49,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2018-11-23 13:09:49,383 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #37#return; {2093#true} is VALID [2018-11-23 13:09:49,383 INFO L256 TraceCheckUtils]: 3: Hoare triple {2093#true} call #t~ret1 := main(); {2093#true} is VALID [2018-11-23 13:09:49,384 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:09:49,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:49,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {2095#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:49,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {2096#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:49,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {2097#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:09:49,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:49,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {2098#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:49,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {2099#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#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:09:49,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:49,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {2100#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:09:49,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:49,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {2101#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:49,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {2102#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:49,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {2103#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#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:09:49,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:49,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {2104#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#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:09:49,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:49,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {2105#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:49,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {2106#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#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:09:49,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:49,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {2107#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:49,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {2108#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:09:49,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:49,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {2109#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:49,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:49,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {2110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2111#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:49,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {2111#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2094#false} is VALID [2018-11-23 13:09:49,414 INFO L256 TraceCheckUtils]: 38: Hoare triple {2094#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2094#false} is VALID [2018-11-23 13:09:49,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2018-11-23 13:09:49,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2018-11-23 13:09:49,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2018-11-23 13:09:49,418 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:09:49,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:49,419 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:09:49,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:09:49,474 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 13:09:49,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:49,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:49,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2018-11-23 13:09:49,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {2093#true} assume true; {2093#true} is VALID [2018-11-23 13:09:49,815 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2093#true} {2093#true} #37#return; {2093#true} is VALID [2018-11-23 13:09:49,816 INFO L256 TraceCheckUtils]: 3: Hoare triple {2093#true} call #t~ret1 := main(); {2093#true} is VALID [2018-11-23 13:09:49,816 INFO L273 TraceCheckUtils]: 4: Hoare triple {2093#true} ~x~0 := 0; {2093#true} is VALID [2018-11-23 13:09:49,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2093#true} is VALID [2018-11-23 13:09:49,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {2093#true} assume !!(~x~0 % 4294967296 < 268435455); {2093#true} is VALID [2018-11-23 13:09:49,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {2093#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:09:49,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:09:49,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {2211#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2218#(and (<= 65520 (mod (+ main_~x~0 4294967294) 4294967296)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2018-11-23 13:09:49,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {2218#(and (<= 65520 (mod (+ main_~x~0 4294967294) 4294967296)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {2218#(and (<= 65520 (mod (+ main_~x~0 4294967294) 4294967296)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2018-11-23 13:09:49,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {2218#(and (<= 65520 (mod (+ main_~x~0 4294967294) 4294967296)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2225#(and (< (mod (+ main_~x~0 4294967291) 4294967296) 65520) (<= 65520 (mod (+ main_~x~0 4294967292) 4294967296)))} is VALID [2018-11-23 13:09:49,828 INFO L273 TraceCheckUtils]: 37: Hoare triple {2225#(and (< (mod (+ main_~x~0 4294967291) 4294967296) 65520) (<= 65520 (mod (+ main_~x~0 4294967292) 4294967296)))} assume !(~x~0 % 4294967296 < 268435455); {2094#false} is VALID [2018-11-23 13:09:49,829 INFO L256 TraceCheckUtils]: 38: Hoare triple {2094#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2094#false} is VALID [2018-11-23 13:09:49,829 INFO L273 TraceCheckUtils]: 39: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2018-11-23 13:09:49,829 INFO L273 TraceCheckUtils]: 40: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2018-11-23 13:09:49,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2018-11-23 13:09:49,834 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:09:49,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:49,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2018-11-23 13:09:49,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:09:49,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:49,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:09:49,921 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:09:49,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:09:49,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:09:49,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:49,923 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 22 states. [2018-11-23 13:09:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:54,861 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 13:09:54,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:09:54,861 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:09:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2018-11-23 13:09:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2018-11-23 13:09:54,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 65 transitions. [2018-11-23 13:09:54,972 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:09:54,974 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:09:54,974 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:09:54,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:09:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:09:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 13:09:55,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:55,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 13:09:55,030 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:09:55,030 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:09:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:55,032 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 13:09:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 13:09:55,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:55,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:55,033 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 13:09:55,033 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 13:09:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:55,034 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 13:09:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 13:09:55,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:55,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:55,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:55,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:09:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 13:09:55,037 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 42 [2018-11-23 13:09:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:55,037 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 13:09:55,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:09:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 13:09:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:09:55,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:55,038 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:55,038 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:55,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1168417095, now seen corresponding path program 7 times [2018-11-23 13:09:55,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:55,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:55,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:55,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:55,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:55,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2018-11-23 13:09:55,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2018-11-23 13:09:55,774 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #37#return; {2509#true} is VALID [2018-11-23 13:09:55,775 INFO L256 TraceCheckUtils]: 3: Hoare triple {2509#true} call #t~ret1 := main(); {2509#true} is VALID [2018-11-23 13:09:55,775 INFO L273 TraceCheckUtils]: 4: Hoare triple {2509#true} ~x~0 := 0; {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:55,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:55,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:55,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:55,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:55,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:55,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:55,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:55,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:55,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:55,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:55,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:55,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:55,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:55,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:55,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:55,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:55,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:55,827 INFO L273 TraceCheckUtils]: 22: Hoare triple {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:55,827 INFO L273 TraceCheckUtils]: 23: Hoare triple {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:55,828 INFO L273 TraceCheckUtils]: 24: Hoare triple {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:55,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:55,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:55,829 INFO L273 TraceCheckUtils]: 27: Hoare triple {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:55,830 INFO L273 TraceCheckUtils]: 28: Hoare triple {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:55,831 INFO L273 TraceCheckUtils]: 29: Hoare triple {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:55,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:55,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:55,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:55,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:55,835 INFO L273 TraceCheckUtils]: 34: Hoare triple {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:55,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:55,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:55,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:55,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2528#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:55,853 INFO L273 TraceCheckUtils]: 39: Hoare triple {2528#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2528#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:55,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {2528#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2529#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:55,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {2529#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {2529#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:55,854 INFO L273 TraceCheckUtils]: 42: Hoare triple {2529#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2530#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:55,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {2530#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2510#false} is VALID [2018-11-23 13:09:55,855 INFO L256 TraceCheckUtils]: 44: Hoare triple {2510#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2510#false} is VALID [2018-11-23 13:09:55,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {2510#false} ~cond := #in~cond; {2510#false} is VALID [2018-11-23 13:09:55,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {2510#false} assume 0 == ~cond; {2510#false} is VALID [2018-11-23 13:09:55,855 INFO L273 TraceCheckUtils]: 47: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2018-11-23 13:09:55,860 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:09:55,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:55,860 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:09:55,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:55,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:56,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2018-11-23 13:09:56,061 INFO L273 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2018-11-23 13:09:56,061 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #37#return; {2509#true} is VALID [2018-11-23 13:09:56,062 INFO L256 TraceCheckUtils]: 3: Hoare triple {2509#true} call #t~ret1 := main(); {2509#true} is VALID [2018-11-23 13:09:56,062 INFO L273 TraceCheckUtils]: 4: Hoare triple {2509#true} ~x~0 := 0; {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:56,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:56,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {2511#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:56,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:56,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {2512#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:56,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:56,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {2513#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:56,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:56,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {2514#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:56,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:56,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {2515#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:56,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:56,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {2516#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:56,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:56,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {2517#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:56,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:56,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {2518#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:56,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:56,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {2519#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:56,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:56,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {2520#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:56,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:56,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {2521#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:56,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:56,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {2522#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:56,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:56,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {2523#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:56,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:56,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {2524#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:56,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:56,087 INFO L273 TraceCheckUtils]: 34: Hoare triple {2525#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:56,088 INFO L273 TraceCheckUtils]: 35: Hoare triple {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:56,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {2526#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:56,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:56,091 INFO L273 TraceCheckUtils]: 38: Hoare triple {2527#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2510#false} is VALID [2018-11-23 13:09:56,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {2510#false} assume !!(~x~0 % 4294967296 < 268435455); {2510#false} is VALID [2018-11-23 13:09:56,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {2510#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2510#false} is VALID [2018-11-23 13:09:56,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {2510#false} assume !!(~x~0 % 4294967296 < 268435455); {2510#false} is VALID [2018-11-23 13:09:56,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {2510#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2510#false} is VALID [2018-11-23 13:09:56,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {2510#false} assume !(~x~0 % 4294967296 < 268435455); {2510#false} is VALID [2018-11-23 13:09:56,092 INFO L256 TraceCheckUtils]: 44: Hoare triple {2510#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2510#false} is VALID [2018-11-23 13:09:56,092 INFO L273 TraceCheckUtils]: 45: Hoare triple {2510#false} ~cond := #in~cond; {2510#false} is VALID [2018-11-23 13:09:56,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {2510#false} assume 0 == ~cond; {2510#false} is VALID [2018-11-23 13:09:56,093 INFO L273 TraceCheckUtils]: 47: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2018-11-23 13:09:56,096 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:09:56,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:56,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 22 [2018-11-23 13:09:56,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:09:56,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:56,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:09:56,174 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:09:56,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:09:56,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:09:56,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:56,176 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 22 states. [2018-11-23 13:09:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:57,995 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 13:09:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:09:57,995 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:09:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:09:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:09:57,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2018-11-23 13:09:58,061 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:09:58,062 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:09:58,063 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:09:58,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:09:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 13:09:58,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:58,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 13:09:58,132 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:09:58,132 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:09:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,133 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 13:09:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:09:58,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:58,134 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:09:58,134 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:09:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,135 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 13:09:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:09:58,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:58,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:58,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:09:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-23 13:09:58,138 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 48 [2018-11-23 13:09:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:58,138 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-23 13:09:58,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:09:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:09:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:09:58,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:58,139 INFO L402 BasicCegarLoop]: trace histogram [21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:58,139 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:58,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:58,139 INFO L82 PathProgramCache]: Analyzing trace with hash 652678003, now seen corresponding path program 8 times [2018-11-23 13:09:58,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:58,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:58,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:58,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2018-11-23 13:09:58,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {2965#true} assume true; {2965#true} is VALID [2018-11-23 13:09:58,637 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2965#true} {2965#true} #37#return; {2965#true} is VALID [2018-11-23 13:09:58,638 INFO L256 TraceCheckUtils]: 3: Hoare triple {2965#true} call #t~ret1 := main(); {2965#true} is VALID [2018-11-23 13:09:58,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {2965#true} ~x~0 := 0; {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:58,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:58,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:58,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:58,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:58,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:58,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:58,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:58,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:58,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:58,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:58,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:58,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:58,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:58,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:58,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:58,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:58,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:58,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:58,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:58,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:58,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:58,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:58,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:58,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:58,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:58,659 INFO L273 TraceCheckUtils]: 30: Hoare triple {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:58,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:58,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:58,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:58,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:58,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:58,664 INFO L273 TraceCheckUtils]: 36: Hoare triple {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:58,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:58,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:09:58,667 INFO L273 TraceCheckUtils]: 39: Hoare triple {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:09:58,668 INFO L273 TraceCheckUtils]: 40: Hoare triple {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:58,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:58,670 INFO L273 TraceCheckUtils]: 42: Hoare triple {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:58,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:58,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:58,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:58,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2988#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:58,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {2988#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2966#false} is VALID [2018-11-23 13:09:58,675 INFO L256 TraceCheckUtils]: 48: Hoare triple {2966#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2966#false} is VALID [2018-11-23 13:09:58,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {2966#false} ~cond := #in~cond; {2966#false} is VALID [2018-11-23 13:09:58,675 INFO L273 TraceCheckUtils]: 50: Hoare triple {2966#false} assume 0 == ~cond; {2966#false} is VALID [2018-11-23 13:09:58,675 INFO L273 TraceCheckUtils]: 51: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2018-11-23 13:09:58,681 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:09:58,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:58,682 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:09:58,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:58,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:58,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:58,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:58,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2018-11-23 13:09:58,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {2965#true} assume true; {2965#true} is VALID [2018-11-23 13:09:58,907 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2965#true} {2965#true} #37#return; {2965#true} is VALID [2018-11-23 13:09:58,907 INFO L256 TraceCheckUtils]: 3: Hoare triple {2965#true} call #t~ret1 := main(); {2965#true} is VALID [2018-11-23 13:09:58,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {2965#true} ~x~0 := 0; {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:58,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:58,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {2967#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:58,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:09:58,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {2968#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:58,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:58,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {2969#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:58,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:09:58,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {2970#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:58,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:58,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:58,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:09:58,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {2972#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:58,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:58,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {2973#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:58,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:09:58,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {2974#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:58,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:58,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {2975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:58,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:09:58,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {2976#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:58,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:58,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {2977#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:58,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:09:58,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {2978#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:58,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:58,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {2979#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:58,927 INFO L273 TraceCheckUtils]: 31: Hoare triple {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:09:58,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {2980#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:58,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:58,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {2981#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:58,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:09:58,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {2982#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:58,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:58,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {2983#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:09:58,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:09:58,956 INFO L273 TraceCheckUtils]: 40: Hoare triple {2984#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:58,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:58,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {2985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:58,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:58,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {2986#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:58,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:58,960 INFO L273 TraceCheckUtils]: 46: Hoare triple {2987#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3130#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:58,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {3130#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2966#false} is VALID [2018-11-23 13:09:58,961 INFO L256 TraceCheckUtils]: 48: Hoare triple {2966#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2966#false} is VALID [2018-11-23 13:09:58,961 INFO L273 TraceCheckUtils]: 49: Hoare triple {2966#false} ~cond := #in~cond; {2966#false} is VALID [2018-11-23 13:09:58,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {2966#false} assume 0 == ~cond; {2966#false} is VALID [2018-11-23 13:09:58,961 INFO L273 TraceCheckUtils]: 51: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2018-11-23 13:09:58,967 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:09:58,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:58,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:09:58,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:09:58,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:58,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:09:59,047 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:09:59,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:09:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:09:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:09:59,049 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 25 states. [2018-11-23 13:10:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:02,148 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-11-23 13:10:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:10:02,148 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:10:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:10:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:10:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:10:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:10:02,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2018-11-23 13:10:02,222 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:10:02,223 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:10:02,223 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:10:02,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 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:10:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:10:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 13:10:02,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:02,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 13:10:02,287 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:10:02,287 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:10:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:02,288 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 13:10:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:10:02,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:02,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:02,289 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:10:02,289 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:10:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:02,291 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 13:10:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:10:02,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:02,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:02,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:02,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:10:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 13:10:02,293 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 52 [2018-11-23 13:10:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:02,293 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 13:10:02,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:10:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:10:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:10:02,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:02,294 INFO L402 BasicCegarLoop]: trace histogram [23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:02,295 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1219877677, now seen corresponding path program 9 times [2018-11-23 13:10:02,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:02,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:03,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {3456#true} call ULTIMATE.init(); {3456#true} is VALID [2018-11-23 13:10:03,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {3456#true} assume true; {3456#true} is VALID [2018-11-23 13:10:03,202 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3456#true} {3456#true} #37#return; {3456#true} is VALID [2018-11-23 13:10:03,202 INFO L256 TraceCheckUtils]: 3: Hoare triple {3456#true} call #t~ret1 := main(); {3456#true} is VALID [2018-11-23 13:10:03,202 INFO L273 TraceCheckUtils]: 4: Hoare triple {3456#true} ~x~0 := 0; {3458#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:03,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {3458#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3458#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:03,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {3458#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3459#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:03,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {3459#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3459#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:03,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {3459#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3460#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:03,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {3460#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3460#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:03,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {3460#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3461#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:03,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {3461#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3461#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:03,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {3461#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3462#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:03,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {3462#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3462#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:03,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {3462#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3463#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:03,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {3463#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3463#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:03,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {3463#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3464#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:03,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {3464#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3464#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:03,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {3464#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3465#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:03,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {3465#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3465#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:03,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {3465#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3466#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:03,221 INFO L273 TraceCheckUtils]: 21: Hoare triple {3466#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3466#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:03,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {3466#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3467#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:03,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {3467#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {3467#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:03,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {3467#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:03,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {3468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:03,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {3468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3469#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:03,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {3469#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3469#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:03,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {3469#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:03,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:03,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:03,228 INFO L273 TraceCheckUtils]: 31: Hoare triple {3471#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3471#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:03,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {3471#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:03,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {3472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:03,231 INFO L273 TraceCheckUtils]: 34: Hoare triple {3472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3473#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:03,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3473#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:03,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {3473#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3474#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:03,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {3474#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3474#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:03,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {3474#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3475#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:03,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {3475#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3475#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:03,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {3475#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3476#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:03,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {3476#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3476#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:03,237 INFO L273 TraceCheckUtils]: 42: Hoare triple {3476#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3477#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:03,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {3477#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3477#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:03,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {3477#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3478#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:03,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {3478#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3478#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:03,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {3478#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3479#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:03,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {3479#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3479#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:03,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {3479#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:03,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {3480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:03,245 INFO L273 TraceCheckUtils]: 50: Hoare triple {3480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3481#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:10:03,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {3481#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3457#false} is VALID [2018-11-23 13:10:03,246 INFO L256 TraceCheckUtils]: 52: Hoare triple {3457#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3457#false} is VALID [2018-11-23 13:10:03,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {3457#false} ~cond := #in~cond; {3457#false} is VALID [2018-11-23 13:10:03,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {3457#false} assume 0 == ~cond; {3457#false} is VALID [2018-11-23 13:10:03,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {3457#false} assume !false; {3457#false} is VALID [2018-11-23 13:10:03,253 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:10:03,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:03,253 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:10:03,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:10:03,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 13:10:03,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:03,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:03,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {3456#true} call ULTIMATE.init(); {3456#true} is VALID [2018-11-23 13:10:03,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {3456#true} assume true; {3456#true} is VALID [2018-11-23 13:10:03,755 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3456#true} {3456#true} #37#return; {3456#true} is VALID [2018-11-23 13:10:03,756 INFO L256 TraceCheckUtils]: 3: Hoare triple {3456#true} call #t~ret1 := main(); {3456#true} is VALID [2018-11-23 13:10:03,756 INFO L273 TraceCheckUtils]: 4: Hoare triple {3456#true} ~x~0 := 0; {3456#true} is VALID [2018-11-23 13:10:03,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 30: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 31: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3456#true} is VALID [2018-11-23 13:10:03,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {3456#true} assume !!(~x~0 % 4294967296 < 268435455); {3456#true} is VALID [2018-11-23 13:10:03,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {3456#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3617#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {3617#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {3617#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {3617#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3624#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {3624#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {3624#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {3624#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3631#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {3631#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {3631#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,835 INFO L273 TraceCheckUtils]: 50: Hoare triple {3631#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3638#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} is VALID [2018-11-23 13:10:03,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {3638#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {3457#false} is VALID [2018-11-23 13:10:03,853 INFO L256 TraceCheckUtils]: 52: Hoare triple {3457#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3457#false} is VALID [2018-11-23 13:10:03,853 INFO L273 TraceCheckUtils]: 53: Hoare triple {3457#false} ~cond := #in~cond; {3457#false} is VALID [2018-11-23 13:10:03,854 INFO L273 TraceCheckUtils]: 54: Hoare triple {3457#false} assume 0 == ~cond; {3457#false} is VALID [2018-11-23 13:10:03,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {3457#false} assume !false; {3457#false} is VALID [2018-11-23 13:10:03,856 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:10:03,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:03,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6] total 30 [2018-11-23 13:10:03,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:10:03,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:03,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:10:03,962 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:10:03,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:10:03,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:10:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:10:03,964 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 30 states. [2018-11-23 13:10:07,791 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-23 13:10:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:11,995 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-23 13:10:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:10:11,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:10:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:10:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2018-11-23 13:10:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:10:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2018-11-23 13:10:12,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 81 transitions. [2018-11-23 13:10:14,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:14,382 INFO L225 Difference]: With dead ends: 79 [2018-11-23 13:10:14,383 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:10:14,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:10:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:10:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-11-23 13:10:14,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:14,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 63 states. [2018-11-23 13:10:14,454 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 63 states. [2018-11-23 13:10:14,454 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 63 states. [2018-11-23 13:10:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:14,456 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 13:10:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 13:10:14,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:14,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:14,457 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 66 states. [2018-11-23 13:10:14,457 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 66 states. [2018-11-23 13:10:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:14,459 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 13:10:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 13:10:14,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:14,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:14,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:14,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:10:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 13:10:14,461 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 56 [2018-11-23 13:10:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:14,462 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 13:10:14,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:10:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 13:10:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:10:14,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:14,463 INFO L402 BasicCegarLoop]: trace histogram [26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:14,463 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:14,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1395503838, now seen corresponding path program 10 times [2018-11-23 13:10:14,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:14,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:14,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:15,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {4010#true} call ULTIMATE.init(); {4010#true} is VALID [2018-11-23 13:10:15,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {4010#true} assume true; {4010#true} is VALID [2018-11-23 13:10:15,599 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4010#true} {4010#true} #37#return; {4010#true} is VALID [2018-11-23 13:10:15,599 INFO L256 TraceCheckUtils]: 3: Hoare triple {4010#true} call #t~ret1 := main(); {4010#true} is VALID [2018-11-23 13:10:15,600 INFO L273 TraceCheckUtils]: 4: Hoare triple {4010#true} ~x~0 := 0; {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:15,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:15,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:15,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:15,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:15,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:15,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:15,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:15,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:15,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:15,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:15,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:15,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:15,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:15,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:15,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:15,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:15,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:15,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:15,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:15,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:15,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:15,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:15,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:15,619 INFO L273 TraceCheckUtils]: 28: Hoare triple {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:15,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:15,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:15,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:15,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:15,623 INFO L273 TraceCheckUtils]: 33: Hoare triple {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:15,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:15,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:15,626 INFO L273 TraceCheckUtils]: 36: Hoare triple {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:15,627 INFO L273 TraceCheckUtils]: 37: Hoare triple {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:15,628 INFO L273 TraceCheckUtils]: 38: Hoare triple {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:15,628 INFO L273 TraceCheckUtils]: 39: Hoare triple {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:15,629 INFO L273 TraceCheckUtils]: 40: Hoare triple {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:15,630 INFO L273 TraceCheckUtils]: 41: Hoare triple {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:15,631 INFO L273 TraceCheckUtils]: 42: Hoare triple {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:15,632 INFO L273 TraceCheckUtils]: 43: Hoare triple {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:15,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:15,633 INFO L273 TraceCheckUtils]: 45: Hoare triple {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:15,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:10:15,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:10:15,636 INFO L273 TraceCheckUtils]: 48: Hoare triple {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:15,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:15,638 INFO L273 TraceCheckUtils]: 50: Hoare triple {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4035#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:15,638 INFO L273 TraceCheckUtils]: 51: Hoare triple {4035#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4035#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:15,639 INFO L273 TraceCheckUtils]: 52: Hoare triple {4035#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:15,640 INFO L273 TraceCheckUtils]: 53: Hoare triple {4036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:15,641 INFO L273 TraceCheckUtils]: 54: Hoare triple {4036#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4037#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:15,642 INFO L273 TraceCheckUtils]: 55: Hoare triple {4037#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4037#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:15,643 INFO L273 TraceCheckUtils]: 56: Hoare triple {4037#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4038#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:10:15,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {4038#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4011#false} is VALID [2018-11-23 13:10:15,644 INFO L256 TraceCheckUtils]: 58: Hoare triple {4011#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4011#false} is VALID [2018-11-23 13:10:15,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {4011#false} ~cond := #in~cond; {4011#false} is VALID [2018-11-23 13:10:15,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {4011#false} assume 0 == ~cond; {4011#false} is VALID [2018-11-23 13:10:15,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {4011#false} assume !false; {4011#false} is VALID [2018-11-23 13:10:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:15,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:15,654 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:10:15,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:10:15,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:10:15,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:15,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:15,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {4010#true} call ULTIMATE.init(); {4010#true} is VALID [2018-11-23 13:10:15,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {4010#true} assume true; {4010#true} is VALID [2018-11-23 13:10:15,987 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4010#true} {4010#true} #37#return; {4010#true} is VALID [2018-11-23 13:10:15,988 INFO L256 TraceCheckUtils]: 3: Hoare triple {4010#true} call #t~ret1 := main(); {4010#true} is VALID [2018-11-23 13:10:15,988 INFO L273 TraceCheckUtils]: 4: Hoare triple {4010#true} ~x~0 := 0; {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:15,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:15,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {4012#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:15,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:15,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {4013#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:15,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:15,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {4014#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:15,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:15,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {4015#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:15,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:15,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {4016#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:15,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:15,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {4017#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:15,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:15,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {4018#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:15,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:15,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {4019#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:16,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:16,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {4020#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:16,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:16,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {4021#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:16,003 INFO L273 TraceCheckUtils]: 25: Hoare triple {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:16,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {4022#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:16,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:16,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {4023#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:16,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:16,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {4024#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:16,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:16,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {4025#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:16,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:16,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {4026#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:16,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:16,012 INFO L273 TraceCheckUtils]: 36: Hoare triple {4027#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:16,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:16,013 INFO L273 TraceCheckUtils]: 38: Hoare triple {4028#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:16,014 INFO L273 TraceCheckUtils]: 39: Hoare triple {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:16,015 INFO L273 TraceCheckUtils]: 40: Hoare triple {4029#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:16,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:16,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {4030#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:16,017 INFO L273 TraceCheckUtils]: 43: Hoare triple {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:16,018 INFO L273 TraceCheckUtils]: 44: Hoare triple {4031#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:16,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:16,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {4032#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:10:16,020 INFO L273 TraceCheckUtils]: 47: Hoare triple {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:10:16,021 INFO L273 TraceCheckUtils]: 48: Hoare triple {4033#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:16,022 INFO L273 TraceCheckUtils]: 49: Hoare triple {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:16,023 INFO L273 TraceCheckUtils]: 50: Hoare triple {4034#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4011#false} is VALID [2018-11-23 13:10:16,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {4011#false} assume !!(~x~0 % 4294967296 < 268435455); {4011#false} is VALID [2018-11-23 13:10:16,024 INFO L273 TraceCheckUtils]: 52: Hoare triple {4011#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4011#false} is VALID [2018-11-23 13:10:16,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {4011#false} assume !!(~x~0 % 4294967296 < 268435455); {4011#false} is VALID [2018-11-23 13:10:16,024 INFO L273 TraceCheckUtils]: 54: Hoare triple {4011#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4011#false} is VALID [2018-11-23 13:10:16,024 INFO L273 TraceCheckUtils]: 55: Hoare triple {4011#false} assume !!(~x~0 % 4294967296 < 268435455); {4011#false} is VALID [2018-11-23 13:10:16,024 INFO L273 TraceCheckUtils]: 56: Hoare triple {4011#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4011#false} is VALID [2018-11-23 13:10:16,025 INFO L273 TraceCheckUtils]: 57: Hoare triple {4011#false} assume !(~x~0 % 4294967296 < 268435455); {4011#false} is VALID [2018-11-23 13:10:16,025 INFO L256 TraceCheckUtils]: 58: Hoare triple {4011#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4011#false} is VALID [2018-11-23 13:10:16,025 INFO L273 TraceCheckUtils]: 59: Hoare triple {4011#false} ~cond := #in~cond; {4011#false} is VALID [2018-11-23 13:10:16,025 INFO L273 TraceCheckUtils]: 60: Hoare triple {4011#false} assume 0 == ~cond; {4011#false} is VALID [2018-11-23 13:10:16,025 INFO L273 TraceCheckUtils]: 61: Hoare triple {4011#false} assume !false; {4011#false} is VALID [2018-11-23 13:10:16,032 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:10:16,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:16,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 29 [2018-11-23 13:10:16,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:10:16,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:16,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:10:16,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:16,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:10:16,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:10:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:10:16,126 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2018-11-23 13:10:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:19,443 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-11-23 13:10:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:10:19,443 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:10:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:10:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:10:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:10:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:10:19,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2018-11-23 13:10:19,568 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:10:19,570 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:10:19,570 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:10:19,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:10:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:10:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:10:19,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:19,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 13:10:19,706 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:10:19,707 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:10:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:19,708 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:10:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:10:19,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:19,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:19,709 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:10:19,709 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:10:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:19,711 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:10:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:10:19,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:19,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:19,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:19,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:10:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-23 13:10:19,713 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-11-23 13:10:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:19,714 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 13:10:19,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:10:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:10:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:10:19,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:19,715 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:19,715 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:19,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:19,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1514026076, now seen corresponding path program 11 times [2018-11-23 13:10:19,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:19,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:19,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:19,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:20,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {4583#true} call ULTIMATE.init(); {4583#true} is VALID [2018-11-23 13:10:20,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {4583#true} assume true; {4583#true} is VALID [2018-11-23 13:10:20,997 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4583#true} {4583#true} #37#return; {4583#true} is VALID [2018-11-23 13:10:20,997 INFO L256 TraceCheckUtils]: 3: Hoare triple {4583#true} call #t~ret1 := main(); {4583#true} is VALID [2018-11-23 13:10:20,997 INFO L273 TraceCheckUtils]: 4: Hoare triple {4583#true} ~x~0 := 0; {4585#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:20,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {4585#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4585#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:20,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {4585#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4586#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:20,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {4586#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4586#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:10:21,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {4586#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4587#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:21,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {4587#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4587#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:21,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {4587#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:21,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:10:21,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {4588#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4589#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:21,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {4589#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4589#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:21,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {4589#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4590#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:21,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {4590#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4590#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:10:21,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {4590#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4591#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:21,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {4591#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4591#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:21,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {4591#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4592#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:21,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {4592#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4592#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:10:21,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {4592#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4593#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:21,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {4593#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4593#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:21,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {4593#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4594#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:21,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {4594#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4594#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:10:21,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {4594#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4595#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:21,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {4595#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4595#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:21,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {4595#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4596#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:21,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {4596#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4596#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:10:21,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {4596#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4597#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:21,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {4597#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4597#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:21,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {4597#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4598#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:21,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {4598#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4598#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:10:21,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {4598#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4599#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:21,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {4599#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4599#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:21,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {4599#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4600#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:21,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {4600#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4600#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:10:21,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {4600#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4601#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:21,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {4601#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4601#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:21,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {4601#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4602#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:21,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {4602#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4602#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:10:21,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {4602#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4603#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:21,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {4603#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4603#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:21,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {4603#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4604#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:21,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {4604#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4604#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:10:21,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {4604#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4605#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:21,031 INFO L273 TraceCheckUtils]: 45: Hoare triple {4605#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4605#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:21,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {4605#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4606#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:10:21,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {4606#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {4606#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:10:21,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {4606#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4607#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:21,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {4607#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4607#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:21,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {4607#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4608#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:10:21,036 INFO L273 TraceCheckUtils]: 51: Hoare triple {4608#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4608#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:10:21,037 INFO L273 TraceCheckUtils]: 52: Hoare triple {4608#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4609#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:21,038 INFO L273 TraceCheckUtils]: 53: Hoare triple {4609#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4609#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:21,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {4609#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4610#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:21,039 INFO L273 TraceCheckUtils]: 55: Hoare triple {4610#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4610#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:21,040 INFO L273 TraceCheckUtils]: 56: Hoare triple {4610#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4611#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:21,041 INFO L273 TraceCheckUtils]: 57: Hoare triple {4611#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4611#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:21,042 INFO L273 TraceCheckUtils]: 58: Hoare triple {4611#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4612#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:21,043 INFO L273 TraceCheckUtils]: 59: Hoare triple {4612#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {4612#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:21,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {4612#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4613#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:10:21,044 INFO L273 TraceCheckUtils]: 61: Hoare triple {4613#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4584#false} is VALID [2018-11-23 13:10:21,045 INFO L256 TraceCheckUtils]: 62: Hoare triple {4584#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4584#false} is VALID [2018-11-23 13:10:21,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {4584#false} ~cond := #in~cond; {4584#false} is VALID [2018-11-23 13:10:21,045 INFO L273 TraceCheckUtils]: 64: Hoare triple {4584#false} assume 0 == ~cond; {4584#false} is VALID [2018-11-23 13:10:21,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {4584#false} assume !false; {4584#false} is VALID [2018-11-23 13:10:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:21,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:21,053 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:10:21,065 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1