java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:20:08,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:20:08,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:20:08,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:20:08,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:20:08,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:20:08,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:20:08,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:20:08,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:20:08,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:20:08,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:20:08,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:20:08,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:20:08,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:20:08,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:20:08,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:20:08,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:20:08,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:20:08,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:20:08,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:20:08,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:20:08,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:20:08,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:20:08,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:20:08,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:20:08,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:20:08,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:20:08,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:20:08,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:20:08,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:20:08,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:20:08,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:20:08,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:20:08,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:20:08,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:20:08,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:20:08,338 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:20:08,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:20:08,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:20:08,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:20:08,353 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:20:08,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:20:08,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:20:08,354 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:20:08,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:20:08,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:20:08,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:20:08,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:20:08,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:20:08,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:20:08,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:20:08,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:20:08,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:20:08,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:20:08,356 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:20:08,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:20:08,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:20:08,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:20:08,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:20:08,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:20:08,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:20:08,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:20:08,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:20:08,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:20:08,358 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:20:08,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:20:08,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:20:08,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:20:08,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:20:08,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:20:08,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:20:08,430 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:20:08,430 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:20:08,431 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-14 19:20:08,488 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515e1ce25/2872271a038f490ab65deecb55356da9/FLAGe32df1cc4 [2018-11-14 19:20:08,960 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:20:08,961 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-14 19:20:08,967 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515e1ce25/2872271a038f490ab65deecb55356da9/FLAGe32df1cc4 [2018-11-14 19:20:08,981 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515e1ce25/2872271a038f490ab65deecb55356da9 [2018-11-14 19:20:08,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:20:08,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:20:08,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:08,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:20:09,002 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:20:09,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:08" (1/1) ... [2018-11-14 19:20:09,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36be1352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09, skipping insertion in model container [2018-11-14 19:20:09,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:08" (1/1) ... [2018-11-14 19:20:09,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:20:09,042 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:20:09,303 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:09,311 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:20:09,332 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:09,350 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:20:09,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09 WrapperNode [2018-11-14 19:20:09,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:09,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:20:09,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:20:09,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:20:09,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (1/1) ... [2018-11-14 19:20:09,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:20:09,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:20:09,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:20:09,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:20:09,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20: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-14 19:20:09,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:20:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:20:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:20:09,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:20:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:20:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:20:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:20:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:20:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:20:09,889 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:20:09,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:09 BoogieIcfgContainer [2018-11-14 19:20:09,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:20:09,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:20:09,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:20:09,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:20:09,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:20:08" (1/3) ... [2018-11-14 19:20:09,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecb9484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:09, skipping insertion in model container [2018-11-14 19:20:09,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:09" (2/3) ... [2018-11-14 19:20:09,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecb9484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:09, skipping insertion in model container [2018-11-14 19:20:09,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:09" (3/3) ... [2018-11-14 19:20:09,899 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow_true-unreach-call1.i [2018-11-14 19:20:09,909 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:20:09,918 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:20:09,935 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:20:09,968 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:20:09,968 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:20:09,969 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:20:09,969 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:20:09,969 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:20:09,969 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:20:09,969 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:20:09,969 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:20:09,970 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:20:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 19:20:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:20:09,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:09,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:10,000 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:10,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 19:20:10,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:10,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 19:20:10,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 19:20:10,189 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 19:20:10,189 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret0 := main(); {21#true} is VALID [2018-11-14 19:20:10,190 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 10; {21#true} is VALID [2018-11-14 19:20:10,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 19:20:10,192 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {22#false} is VALID [2018-11-14 19:20:10,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 19:20:10,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0; {22#false} is VALID [2018-11-14 19:20:10,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 19:20:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:10,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:10,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:20:10,205 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:10,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:10,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:20:10,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:10,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:20:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:20:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:20:10,297 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 19:20:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:10,380 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 19:20:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:20:10,380 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 19:20:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 19:20:10,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 19:20:10,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:10,617 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:20:10,617 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 19:20:10,621 INFO L604 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-14 19:20:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 19:20:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 19:20:10,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:10,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:10,686 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:10,686 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:10,689 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 19:20:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:20:10,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:10,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:10,690 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:10,691 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:10,694 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 19:20:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:20:10,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:10,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:10,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:10,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:20:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 19:20:10,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 19:20:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:10,701 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 19:20:10,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:20:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:20:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:20:10,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:10,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:10,704 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:10,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 19:20:10,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:10,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:11,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-14 19:20:11,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-14 19:20:11,098 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-14 19:20:11,098 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret0 := main(); {106#true} is VALID [2018-11-14 19:20:11,104 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 10; {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:11,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} assume true; {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:11,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {107#false} is VALID [2018-11-14 19:20:11,115 INFO L256 TraceCheckUtils]: 7: Hoare triple {107#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {107#false} is VALID [2018-11-14 19:20:11,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-14 19:20:11,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume ~cond == 0; {107#false} is VALID [2018-11-14 19:20:11,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-14 19:20:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:11,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:11,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:20:11,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:11,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:11,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:20:11,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:11,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:20:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:20:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:20:11,181 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 19:20:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:11,242 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 19:20:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:20:11,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 19:20:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 19:20:11,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 19:20:11,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:11,388 INFO L225 Difference]: With dead ends: 19 [2018-11-14 19:20:11,388 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 19:20:11,389 INFO L604 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-14 19:20:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 19:20:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 19:20:11,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:11,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:11,404 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:11,404 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:11,406 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:20:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:20:11,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:11,407 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:11,407 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:11,409 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:20:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:20:11,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:11,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:11,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:11,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:20:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 19:20:11,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 19:20:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:11,413 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 19:20:11,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:20:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:20:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:20:11,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:11,414 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:11,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:11,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 19:20:11,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:11,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 19:20:11,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 19:20:11,598 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 19:20:11,598 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret0 := main(); {190#true} is VALID [2018-11-14 19:20:11,599 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 10; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:11,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:11,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:11,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:11,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {191#false} is VALID [2018-11-14 19:20:11,605 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {191#false} is VALID [2018-11-14 19:20:11,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 19:20:11,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 19:20:11,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 19:20:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:11,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:11,609 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-14 19:20:11,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:11,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:11,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 19:20:11,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 19:20:11,911 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 19:20:11,911 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret0 := main(); {190#true} is VALID [2018-11-14 19:20:11,913 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 10; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:11,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:11,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:11,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:11,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {191#false} is VALID [2018-11-14 19:20:11,937 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {191#false} is VALID [2018-11-14 19:20:11,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 19:20:11,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 19:20:11,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 19:20:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:11,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:11,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 19:20:11,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:20:11,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:11,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:20:12,186 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-14 19:20:12,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:20:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:20:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:20:12,187 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-14 19:20:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,462 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-14 19:20:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:20:12,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:20:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:20:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-14 19:20:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:20:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-14 19:20:12,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2018-11-14 19:20:12,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:12,548 INFO L225 Difference]: With dead ends: 23 [2018-11-14 19:20:12,548 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:20:12,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:20:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:20:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 19:20:12,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:12,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:12,564 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:12,564 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,565 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:20:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:20:12,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:12,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:12,566 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:12,567 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,568 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:20:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:20:12,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:12,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:12,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:12,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:20:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 19:20:12,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2018-11-14 19:20:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:12,572 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 19:20:12,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:20:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:20:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:20:12,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:12,573 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:12,574 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:12,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 2 times [2018-11-14 19:20:12,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:12,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:12,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:12,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:12,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:12,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2018-11-14 19:20:12,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 19:20:12,840 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {332#true} {332#true} #32#return; {332#true} is VALID [2018-11-14 19:20:12,840 INFO L256 TraceCheckUtils]: 3: Hoare triple {332#true} call #t~ret0 := main(); {332#true} is VALID [2018-11-14 19:20:12,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {332#true} ~x~0 := 10; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:12,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:12,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:12,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:12,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:12,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:12,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:12,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:12,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {333#false} is VALID [2018-11-14 19:20:12,859 INFO L256 TraceCheckUtils]: 13: Hoare triple {333#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {333#false} is VALID [2018-11-14 19:20:12,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2018-11-14 19:20:12,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {333#false} assume ~cond == 0; {333#false} is VALID [2018-11-14 19:20:12,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {333#false} assume !false; {333#false} is VALID [2018-11-14 19:20:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:12,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:12,862 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-14 19:20:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:20:12,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:20:12,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:12,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:13,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2018-11-14 19:20:13,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-14 19:20:13,103 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {332#true} {332#true} #32#return; {332#true} is VALID [2018-11-14 19:20:13,103 INFO L256 TraceCheckUtils]: 3: Hoare triple {332#true} call #t~ret0 := main(); {332#true} is VALID [2018-11-14 19:20:13,104 INFO L273 TraceCheckUtils]: 4: Hoare triple {332#true} ~x~0 := 10; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:13,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:13,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:13,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:13,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:13,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:13,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:13,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:13,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {333#false} is VALID [2018-11-14 19:20:13,115 INFO L256 TraceCheckUtils]: 13: Hoare triple {333#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {333#false} is VALID [2018-11-14 19:20:13,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2018-11-14 19:20:13,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {333#false} assume ~cond == 0; {333#false} is VALID [2018-11-14 19:20:13,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {333#false} assume !false; {333#false} is VALID [2018-11-14 19:20:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:13,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:13,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 19:20:13,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 19:20:13,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:13,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:20:13,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:13,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:20:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:20:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:20:13,169 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-14 19:20:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,419 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-14 19:20:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:20:13,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 19:20:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-14 19:20:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-14 19:20:13,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2018-11-14 19:20:13,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:13,517 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:20:13,517 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:20:13,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:20:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:20:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 19:20:13,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:13,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:13,548 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:13,549 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,551 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:20:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:20:13,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,552 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:13,552 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,554 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:20:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:20:13,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:13,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:20:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 19:20:13,557 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2018-11-14 19:20:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:13,557 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 19:20:13,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:20:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:20:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:20:13,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:13,559 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:13,559 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:13,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 3 times [2018-11-14 19:20:13,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:14,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-14 19:20:14,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-14 19:20:14,159 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #32#return; {508#true} is VALID [2018-11-14 19:20:14,159 INFO L256 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret0 := main(); {508#true} is VALID [2018-11-14 19:20:14,160 INFO L273 TraceCheckUtils]: 4: Hoare triple {508#true} ~x~0 := 10; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:14,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:14,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:14,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:14,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:14,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:14,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:14,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:14,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:14,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:14,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:14,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:14,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {509#false} is VALID [2018-11-14 19:20:14,182 INFO L256 TraceCheckUtils]: 17: Hoare triple {509#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {509#false} is VALID [2018-11-14 19:20:14,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {509#false} ~cond := #in~cond; {509#false} is VALID [2018-11-14 19:20:14,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {509#false} assume ~cond == 0; {509#false} is VALID [2018-11-14 19:20:14,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-14 19:20:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:14,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:14,184 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-14 19:20:14,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:20:26,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 19:20:26,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:26,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:26,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-14 19:20:26,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-14 19:20:26,451 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #32#return; {508#true} is VALID [2018-11-14 19:20:26,451 INFO L256 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret0 := main(); {508#true} is VALID [2018-11-14 19:20:26,458 INFO L273 TraceCheckUtils]: 4: Hoare triple {508#true} ~x~0 := 10; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:26,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:26,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:26,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:26,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:26,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:26,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:26,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:26,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:26,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:26,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:26,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:26,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 10); {509#false} is VALID [2018-11-14 19:20:26,477 INFO L256 TraceCheckUtils]: 17: Hoare triple {509#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {509#false} is VALID [2018-11-14 19:20:26,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {509#false} ~cond := #in~cond; {509#false} is VALID [2018-11-14 19:20:26,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {509#false} assume ~cond == 0; {509#false} is VALID [2018-11-14 19:20:26,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-14 19:20:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:26,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:26,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 19:20:26,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 19:20:26,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:26,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:20:26,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:26,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:20:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:20:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:20:26,552 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-14 19:20:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:26,953 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 19:20:26,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:20:26,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 19:20:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:20:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-14 19:20:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:20:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-14 19:20:26,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2018-11-14 19:20:27,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:27,017 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:20:27,018 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 19:20:27,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:20:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 19:20:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 19:20:27,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:27,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 19:20:27,046 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 19:20:27,046 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 19:20:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:27,049 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 19:20:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 19:20:27,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:27,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:27,050 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 19:20:27,050 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 19:20:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:27,052 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 19:20:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 19:20:27,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:27,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:27,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:27,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 19:20:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 19:20:27,056 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2018-11-14 19:20:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:27,056 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 19:20:27,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:20:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 19:20:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 19:20:27,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:27,058 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:27,058 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:27,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 4 times [2018-11-14 19:20:27,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:27,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:27,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:27,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-14 19:20:27,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-14 19:20:27,600 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {718#true} {718#true} #32#return; {718#true} is VALID [2018-11-14 19:20:27,600 INFO L256 TraceCheckUtils]: 3: Hoare triple {718#true} call #t~ret0 := main(); {718#true} is VALID [2018-11-14 19:20:27,602 INFO L273 TraceCheckUtils]: 4: Hoare triple {718#true} ~x~0 := 10; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:27,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:27,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:27,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:27,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:27,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:27,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:27,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:27,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:27,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:27,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:27,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:27,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:27,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:27,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:27,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} assume true; {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:27,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {719#false} is VALID [2018-11-14 19:20:27,627 INFO L256 TraceCheckUtils]: 21: Hoare triple {719#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {719#false} is VALID [2018-11-14 19:20:27,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2018-11-14 19:20:27,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {719#false} assume ~cond == 0; {719#false} is VALID [2018-11-14 19:20:27,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-14 19:20:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:27,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:27,630 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-14 19:20:27,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:20:27,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:20:27,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:27,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:27,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-14 19:20:27,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-14 19:20:27,858 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {718#true} {718#true} #32#return; {718#true} is VALID [2018-11-14 19:20:27,859 INFO L256 TraceCheckUtils]: 3: Hoare triple {718#true} call #t~ret0 := main(); {718#true} is VALID [2018-11-14 19:20:27,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {718#true} ~x~0 := 10; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:27,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:27,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:27,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:27,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:27,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:27,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:27,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:27,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:27,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:27,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:27,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:27,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:27,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:27,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:27,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:27,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {719#false} is VALID [2018-11-14 19:20:27,877 INFO L256 TraceCheckUtils]: 21: Hoare triple {719#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {719#false} is VALID [2018-11-14 19:20:27,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2018-11-14 19:20:27,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {719#false} assume ~cond == 0; {719#false} is VALID [2018-11-14 19:20:27,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-14 19:20:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:27,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:27,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 19:20:27,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-14 19:20:27,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:27,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:20:27,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:27,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:20:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:20:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:20:27,939 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 11 states. [2018-11-14 19:20:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:28,374 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-14 19:20:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:20:28,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-14 19:20:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:20:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-11-14 19:20:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:20:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-11-14 19:20:28,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2018-11-14 19:20:28,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:28,433 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:20:28,433 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 19:20:28,434 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:20:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 19:20:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 19:20:28,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:28,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 19:20:28,498 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 19:20:28,498 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 19:20:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:28,500 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 19:20:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 19:20:28,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:28,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:28,501 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 19:20:28,501 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 19:20:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:28,503 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 19:20:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 19:20:28,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:28,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:28,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:28,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 19:20:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-14 19:20:28,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2018-11-14 19:20:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:28,507 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-14 19:20:28,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:20:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 19:20:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 19:20:28,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:28,508 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:28,509 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:28,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 5 times [2018-11-14 19:20:28,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:28,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:28,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:28,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:28,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {962#true} call ULTIMATE.init(); {962#true} is VALID [2018-11-14 19:20:28,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {962#true} assume true; {962#true} is VALID [2018-11-14 19:20:28,868 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {962#true} {962#true} #32#return; {962#true} is VALID [2018-11-14 19:20:28,868 INFO L256 TraceCheckUtils]: 3: Hoare triple {962#true} call #t~ret0 := main(); {962#true} is VALID [2018-11-14 19:20:28,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {962#true} ~x~0 := 10; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:28,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:28,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:28,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:28,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:28,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:28,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:28,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:28,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:28,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:28,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:28,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:28,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:28,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:28,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:28,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:28,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:28,889 INFO L273 TraceCheckUtils]: 21: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:28,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:28,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:20:28,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {963#false} is VALID [2018-11-14 19:20:28,893 INFO L256 TraceCheckUtils]: 25: Hoare triple {963#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {963#false} is VALID [2018-11-14 19:20:28,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {963#false} ~cond := #in~cond; {963#false} is VALID [2018-11-14 19:20:28,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {963#false} assume ~cond == 0; {963#false} is VALID [2018-11-14 19:20:28,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {963#false} assume !false; {963#false} is VALID [2018-11-14 19:20:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:28,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:28,898 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-14 19:20:28,907 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:20:54,932 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-14 19:20:54,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:55,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:55,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {962#true} call ULTIMATE.init(); {962#true} is VALID [2018-11-14 19:20:55,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {962#true} assume true; {962#true} is VALID [2018-11-14 19:20:55,185 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {962#true} {962#true} #32#return; {962#true} is VALID [2018-11-14 19:20:55,185 INFO L256 TraceCheckUtils]: 3: Hoare triple {962#true} call #t~ret0 := main(); {962#true} is VALID [2018-11-14 19:20:55,191 INFO L273 TraceCheckUtils]: 4: Hoare triple {962#true} ~x~0 := 10; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:55,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:55,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:55,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:55,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:55,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:55,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:55,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:55,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:55,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:55,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:55,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:55,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:55,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:55,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:55,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:55,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:55,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:55,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:55,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:55,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {963#false} is VALID [2018-11-14 19:20:55,232 INFO L256 TraceCheckUtils]: 25: Hoare triple {963#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {963#false} is VALID [2018-11-14 19:20:55,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {963#false} ~cond := #in~cond; {963#false} is VALID [2018-11-14 19:20:55,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {963#false} assume ~cond == 0; {963#false} is VALID [2018-11-14 19:20:55,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {963#false} assume !false; {963#false} is VALID [2018-11-14 19:20:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:55,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:55,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 19:20:55,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-14 19:20:55,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:55,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 19:20:55,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:55,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 19:20:55,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 19:20:55,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:20:55,312 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 13 states. [2018-11-14 19:20:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:55,924 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-14 19:20:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 19:20:55,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-14 19:20:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:20:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2018-11-14 19:20:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:20:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2018-11-14 19:20:55,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2018-11-14 19:20:56,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:56,012 INFO L225 Difference]: With dead ends: 39 [2018-11-14 19:20:56,012 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 19:20:56,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-14 19:20:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 19:20:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 19:20:56,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:56,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 19:20:56,071 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 19:20:56,071 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 19:20:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:56,073 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 19:20:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 19:20:56,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:56,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:56,074 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 19:20:56,074 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 19:20:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:56,076 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 19:20:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 19:20:56,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:56,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:56,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:56,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 19:20:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-14 19:20:56,079 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 29 [2018-11-14 19:20:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:56,079 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-14 19:20:56,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 19:20:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 19:20:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 19:20:56,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:56,081 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:56,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:56,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 6 times [2018-11-14 19:20:56,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:56,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:57,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-14 19:20:57,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-14 19:20:57,600 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #32#return; {1240#true} is VALID [2018-11-14 19:20:57,600 INFO L256 TraceCheckUtils]: 3: Hoare triple {1240#true} call #t~ret0 := main(); {1240#true} is VALID [2018-11-14 19:20:57,601 INFO L273 TraceCheckUtils]: 4: Hoare triple {1240#true} ~x~0 := 10; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:57,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:57,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:57,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:57,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:57,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:57,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:57,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:57,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:57,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:57,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:57,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:57,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:57,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:57,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:57,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:57,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:57,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:57,623 INFO L273 TraceCheckUtils]: 22: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:57,626 INFO L273 TraceCheckUtils]: 23: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:57,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:20:57,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:20:57,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} is VALID [2018-11-14 19:20:57,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} assume true; {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} is VALID [2018-11-14 19:20:57,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1241#false} is VALID [2018-11-14 19:20:57,634 INFO L256 TraceCheckUtils]: 29: Hoare triple {1241#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1241#false} is VALID [2018-11-14 19:20:57,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-14 19:20:57,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {1241#false} assume ~cond == 0; {1241#false} is VALID [2018-11-14 19:20:57,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-14 19:20:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:57,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:57,638 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-14 19:20:57,647 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:20:57,793 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-14 19:20:57,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:57,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:57,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-14 19:20:57,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-14 19:20:57,986 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #32#return; {1240#true} is VALID [2018-11-14 19:20:57,987 INFO L256 TraceCheckUtils]: 3: Hoare triple {1240#true} call #t~ret0 := main(); {1240#true} is VALID [2018-11-14 19:20:57,987 INFO L273 TraceCheckUtils]: 4: Hoare triple {1240#true} ~x~0 := 10; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:57,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:57,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:57,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:57,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:57,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:57,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:57,992 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:57,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:57,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:57,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:57,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:57,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:57,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:57,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:57,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:58,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:58,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:58,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:58,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:58,004 INFO L273 TraceCheckUtils]: 24: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:20:58,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:20:58,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:20:58,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:20:58,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1241#false} is VALID [2018-11-14 19:20:58,008 INFO L256 TraceCheckUtils]: 29: Hoare triple {1241#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1241#false} is VALID [2018-11-14 19:20:58,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-14 19:20:58,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {1241#false} assume ~cond == 0; {1241#false} is VALID [2018-11-14 19:20:58,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-14 19:20:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 19:20:58,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-14 19:20:58,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:58,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 19:20:58,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:58,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 19:20:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 19:20:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:20:58,245 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 15 states. [2018-11-14 19:20:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:59,091 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-14 19:20:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 19:20:59,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-14 19:20:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:20:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-14 19:20:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:20:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-14 19:20:59,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2018-11-14 19:20:59,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:59,148 INFO L225 Difference]: With dead ends: 43 [2018-11-14 19:20:59,149 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 19:20:59,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:20:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 19:20:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 19:20:59,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:59,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 19:20:59,265 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 19:20:59,265 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 19:20:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:59,267 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 19:20:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 19:20:59,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:59,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:59,268 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 19:20:59,268 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 19:20:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:59,270 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-14 19:20:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 19:20:59,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:59,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:59,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:59,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 19:20:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-14 19:20:59,273 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 33 [2018-11-14 19:20:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:59,273 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-14 19:20:59,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 19:20:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-14 19:20:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 19:20:59,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:59,275 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:59,275 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:59,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:59,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 7 times [2018-11-14 19:20:59,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:59,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:59,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:59,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:59,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2018-11-14 19:20:59,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {1552#true} assume true; {1552#true} is VALID [2018-11-14 19:20:59,947 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1552#true} {1552#true} #32#return; {1552#true} is VALID [2018-11-14 19:20:59,947 INFO L256 TraceCheckUtils]: 3: Hoare triple {1552#true} call #t~ret0 := main(); {1552#true} is VALID [2018-11-14 19:20:59,951 INFO L273 TraceCheckUtils]: 4: Hoare triple {1552#true} ~x~0 := 10; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:59,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:59,952 INFO L273 TraceCheckUtils]: 6: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:59,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:59,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:59,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:59,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:59,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:20:59,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:59,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:20:59,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:59,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:20:59,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:59,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:20:59,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:59,963 INFO L273 TraceCheckUtils]: 19: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:20:59,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:59,964 INFO L273 TraceCheckUtils]: 21: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:20:59,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:59,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:20:59,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:20:59,967 INFO L273 TraceCheckUtils]: 25: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:20:59,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:20:59,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:20:59,969 INFO L273 TraceCheckUtils]: 28: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:20:59,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:20:59,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} is VALID [2018-11-14 19:20:59,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} assume true; {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} is VALID [2018-11-14 19:20:59,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1553#false} is VALID [2018-11-14 19:20:59,973 INFO L256 TraceCheckUtils]: 33: Hoare triple {1553#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1553#false} is VALID [2018-11-14 19:20:59,973 INFO L273 TraceCheckUtils]: 34: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2018-11-14 19:20:59,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {1553#false} assume ~cond == 0; {1553#false} is VALID [2018-11-14 19:20:59,974 INFO L273 TraceCheckUtils]: 36: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2018-11-14 19:20:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:59,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:59,976 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-14 19:20:59,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:00,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:00,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2018-11-14 19:21:00,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {1552#true} assume true; {1552#true} is VALID [2018-11-14 19:21:00,139 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1552#true} {1552#true} #32#return; {1552#true} is VALID [2018-11-14 19:21:00,139 INFO L256 TraceCheckUtils]: 3: Hoare triple {1552#true} call #t~ret0 := main(); {1552#true} is VALID [2018-11-14 19:21:00,140 INFO L273 TraceCheckUtils]: 4: Hoare triple {1552#true} ~x~0 := 10; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:00,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:00,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:00,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:00,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:00,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:00,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:00,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:00,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:00,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:00,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:00,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:00,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:00,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:00,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:00,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:00,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:00,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:00,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:00,187 INFO L273 TraceCheckUtils]: 23: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:00,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:00,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:00,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:00,189 INFO L273 TraceCheckUtils]: 27: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:00,190 INFO L273 TraceCheckUtils]: 28: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:00,190 INFO L273 TraceCheckUtils]: 29: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:00,191 INFO L273 TraceCheckUtils]: 30: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:00,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:00,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1553#false} is VALID [2018-11-14 19:21:00,193 INFO L256 TraceCheckUtils]: 33: Hoare triple {1553#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1553#false} is VALID [2018-11-14 19:21:00,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2018-11-14 19:21:00,193 INFO L273 TraceCheckUtils]: 35: Hoare triple {1553#false} assume ~cond == 0; {1553#false} is VALID [2018-11-14 19:21:00,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2018-11-14 19:21:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:00,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:00,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 19:21:00,216 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-14 19:21:00,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:00,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 19:21:00,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:00,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 19:21:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 19:21:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:21:00,260 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 17 states. [2018-11-14 19:21:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:01,235 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-14 19:21:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 19:21:01,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-14 19:21:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:21:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2018-11-14 19:21:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:21:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2018-11-14 19:21:01,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2018-11-14 19:21:01,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:01,299 INFO L225 Difference]: With dead ends: 47 [2018-11-14 19:21:01,299 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:21:01,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:21:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:21:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 19:21:01,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:01,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 19:21:01,339 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:21:01,340 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:21:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:01,341 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 19:21:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 19:21:01,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:01,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:01,342 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:21:01,342 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:21:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:01,344 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 19:21:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 19:21:01,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:01,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:01,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:01,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 19:21:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-14 19:21:01,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 37 [2018-11-14 19:21:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:01,347 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-14 19:21:01,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 19:21:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 19:21:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 19:21:01,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:01,348 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:01,348 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:01,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 8 times [2018-11-14 19:21:01,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:01,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-14 19:21:01,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 19:21:01,800 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1898#true} {1898#true} #32#return; {1898#true} is VALID [2018-11-14 19:21:01,801 INFO L256 TraceCheckUtils]: 3: Hoare triple {1898#true} call #t~ret0 := main(); {1898#true} is VALID [2018-11-14 19:21:01,801 INFO L273 TraceCheckUtils]: 4: Hoare triple {1898#true} ~x~0 := 10; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:01,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:01,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:01,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:01,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:01,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:01,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:01,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:01,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:01,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:01,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:01,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:01,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:01,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:01,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:01,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:01,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:01,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:01,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:01,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:01,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:01,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:01,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:01,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:01,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:01,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:01,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:01,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:01,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:01,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:01,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:01,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} assume true; {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:01,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1899#false} is VALID [2018-11-14 19:21:01,838 INFO L256 TraceCheckUtils]: 37: Hoare triple {1899#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1899#false} is VALID [2018-11-14 19:21:01,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-14 19:21:01,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} assume ~cond == 0; {1899#false} is VALID [2018-11-14 19:21:01,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-14 19:21:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:01,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:01,841 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-14 19:21:01,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:21:01,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:21:01,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:01,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:02,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-14 19:21:02,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-14 19:21:02,029 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1898#true} {1898#true} #32#return; {1898#true} is VALID [2018-11-14 19:21:02,029 INFO L256 TraceCheckUtils]: 3: Hoare triple {1898#true} call #t~ret0 := main(); {1898#true} is VALID [2018-11-14 19:21:02,030 INFO L273 TraceCheckUtils]: 4: Hoare triple {1898#true} ~x~0 := 10; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:02,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:02,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:02,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:02,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:02,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:02,034 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:02,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:02,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:02,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:02,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:02,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:02,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:02,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:02,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:02,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:02,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:02,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:02,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:02,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:02,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:02,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:02,099 INFO L273 TraceCheckUtils]: 26: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:02,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:02,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:02,124 INFO L273 TraceCheckUtils]: 29: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:02,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:02,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:02,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:02,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:02,128 INFO L273 TraceCheckUtils]: 34: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:02,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:02,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1899#false} is VALID [2018-11-14 19:21:02,130 INFO L256 TraceCheckUtils]: 37: Hoare triple {1899#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1899#false} is VALID [2018-11-14 19:21:02,130 INFO L273 TraceCheckUtils]: 38: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-14 19:21:02,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} assume ~cond == 0; {1899#false} is VALID [2018-11-14 19:21:02,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-14 19:21:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:02,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:02,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 19:21:02,154 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-11-14 19:21:02,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:02,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 19:21:02,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:02,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 19:21:02,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 19:21:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-11-14 19:21:02,206 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 19 states. [2018-11-14 19:21:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:03,529 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-14 19:21:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 19:21:03,529 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-11-14 19:21:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:21:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2018-11-14 19:21:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:21:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2018-11-14 19:21:03,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2018-11-14 19:21:03,595 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-14 19:21:03,597 INFO L225 Difference]: With dead ends: 51 [2018-11-14 19:21:03,597 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 19:21:03,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-11-14 19:21:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 19:21:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 19:21:03,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:03,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 19:21:03,646 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 19:21:03,646 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 19:21:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:03,648 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 19:21:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 19:21:03,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:03,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:03,649 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 19:21:03,650 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 19:21:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:03,651 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-14 19:21:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 19:21:03,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:03,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:03,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:03,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 19:21:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-14 19:21:03,654 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 41 [2018-11-14 19:21:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:03,654 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-14 19:21:03,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 19:21:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-14 19:21:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 19:21:03,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:03,656 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:03,656 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:03,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 9 times [2018-11-14 19:21:03,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:03,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:03,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:21:03,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:04,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {2278#true} call ULTIMATE.init(); {2278#true} is VALID [2018-11-14 19:21:04,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {2278#true} assume true; {2278#true} is VALID [2018-11-14 19:21:04,153 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2278#true} {2278#true} #32#return; {2278#true} is VALID [2018-11-14 19:21:04,154 INFO L256 TraceCheckUtils]: 3: Hoare triple {2278#true} call #t~ret0 := main(); {2278#true} is VALID [2018-11-14 19:21:04,154 INFO L273 TraceCheckUtils]: 4: Hoare triple {2278#true} ~x~0 := 10; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:04,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:04,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:04,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:04,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:04,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:04,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:04,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:04,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:04,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:04,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:04,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:04,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:04,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:04,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:04,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:04,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:04,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:04,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:04,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:04,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:04,175 INFO L273 TraceCheckUtils]: 25: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:04,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:04,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:04,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:04,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:04,180 INFO L273 TraceCheckUtils]: 30: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:04,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:04,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:04,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:04,183 INFO L273 TraceCheckUtils]: 34: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:04,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:04,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:04,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:04,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:21:04,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:21:04,189 INFO L273 TraceCheckUtils]: 40: Hoare triple {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {2279#false} is VALID [2018-11-14 19:21:04,189 INFO L256 TraceCheckUtils]: 41: Hoare triple {2279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2279#false} is VALID [2018-11-14 19:21:04,190 INFO L273 TraceCheckUtils]: 42: Hoare triple {2279#false} ~cond := #in~cond; {2279#false} is VALID [2018-11-14 19:21:04,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {2279#false} assume ~cond == 0; {2279#false} is VALID [2018-11-14 19:21:04,190 INFO L273 TraceCheckUtils]: 44: Hoare triple {2279#false} assume !false; {2279#false} is VALID [2018-11-14 19:21:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:04,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:04,195 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-14 19:21:04,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:21:28,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-14 19:21:28,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:28,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:28,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {2278#true} call ULTIMATE.init(); {2278#true} is VALID [2018-11-14 19:21:28,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {2278#true} assume true; {2278#true} is VALID [2018-11-14 19:21:28,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2278#true} {2278#true} #32#return; {2278#true} is VALID [2018-11-14 19:21:28,484 INFO L256 TraceCheckUtils]: 3: Hoare triple {2278#true} call #t~ret0 := main(); {2278#true} is VALID [2018-11-14 19:21:28,485 INFO L273 TraceCheckUtils]: 4: Hoare triple {2278#true} ~x~0 := 10; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:28,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:28,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:28,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:28,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:28,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:28,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:28,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:28,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:28,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:28,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:28,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:28,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:28,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:28,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:28,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:28,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:28,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:28,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:28,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:28,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:28,526 INFO L273 TraceCheckUtils]: 33: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:28,527 INFO L273 TraceCheckUtils]: 34: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:28,528 INFO L273 TraceCheckUtils]: 35: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:28,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:28,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:28,530 INFO L273 TraceCheckUtils]: 38: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:28,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:28,532 INFO L273 TraceCheckUtils]: 40: Hoare triple {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 >= 10); {2279#false} is VALID [2018-11-14 19:21:28,532 INFO L256 TraceCheckUtils]: 41: Hoare triple {2279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2279#false} is VALID [2018-11-14 19:21:28,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {2279#false} ~cond := #in~cond; {2279#false} is VALID [2018-11-14 19:21:28,533 INFO L273 TraceCheckUtils]: 43: Hoare triple {2279#false} assume ~cond == 0; {2279#false} is VALID [2018-11-14 19:21:28,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {2279#false} assume !false; {2279#false} is VALID [2018-11-14 19:21:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:28,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:28,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 19:21:28,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-11-14 19:21:28,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:28,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 19:21:28,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:28,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 19:21:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 19:21:28,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:21:28,607 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 21 states. [2018-11-14 19:21:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:30,267 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-14 19:21:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 19:21:30,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-11-14 19:21:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:21:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2018-11-14 19:21:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:21:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2018-11-14 19:21:30,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2018-11-14 19:21:30,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:30,367 INFO L225 Difference]: With dead ends: 55 [2018-11-14 19:21:30,368 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 19:21:30,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:21:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 19:21:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 19:21:30,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:30,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 19:21:30,403 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 19:21:30,403 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 19:21:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:30,405 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-14 19:21:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-14 19:21:30,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:30,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:30,405 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 19:21:30,405 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 19:21:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:30,407 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-14 19:21:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-14 19:21:30,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:30,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:30,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:30,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 19:21:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-14 19:21:30,409 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 45 [2018-11-14 19:21:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:30,409 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-14 19:21:30,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 19:21:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-14 19:21:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 19:21:30,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:30,410 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:30,410 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:30,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 880063306, now seen corresponding path program 10 times [2018-11-14 19:21:30,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:30,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:21:30,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:30,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-14 19:21:30,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-14 19:21:30,907 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2692#true} {2692#true} #32#return; {2692#true} is VALID [2018-11-14 19:21:30,907 INFO L256 TraceCheckUtils]: 3: Hoare triple {2692#true} call #t~ret0 := main(); {2692#true} is VALID [2018-11-14 19:21:30,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {2692#true} ~x~0 := 10; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:30,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:30,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:30,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:30,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:30,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:30,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:30,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:30,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:30,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:30,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:30,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:30,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:30,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:30,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:30,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:30,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:30,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:30,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:30,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:30,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:30,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:30,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:30,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:30,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:30,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:30,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:30,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:30,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:30,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:30,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:30,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:30,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:30,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:30,936 INFO L273 TraceCheckUtils]: 38: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:30,937 INFO L273 TraceCheckUtils]: 39: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:30,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-14 19:21:30,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-14 19:21:30,939 INFO L273 TraceCheckUtils]: 42: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:21:30,940 INFO L273 TraceCheckUtils]: 43: Hoare triple {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-14 19:21:30,941 INFO L273 TraceCheckUtils]: 44: Hoare triple {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {2693#false} is VALID [2018-11-14 19:21:30,941 INFO L256 TraceCheckUtils]: 45: Hoare triple {2693#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2693#false} is VALID [2018-11-14 19:21:30,941 INFO L273 TraceCheckUtils]: 46: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-14 19:21:30,942 INFO L273 TraceCheckUtils]: 47: Hoare triple {2693#false} assume ~cond == 0; {2693#false} is VALID [2018-11-14 19:21:30,942 INFO L273 TraceCheckUtils]: 48: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-14 19:21:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:30,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:30,947 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-14 19:21:30,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:21:30,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:21:30,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:30,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:31,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-14 19:21:31,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-14 19:21:31,180 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2692#true} {2692#true} #32#return; {2692#true} is VALID [2018-11-14 19:21:31,180 INFO L256 TraceCheckUtils]: 3: Hoare triple {2692#true} call #t~ret0 := main(); {2692#true} is VALID [2018-11-14 19:21:31,181 INFO L273 TraceCheckUtils]: 4: Hoare triple {2692#true} ~x~0 := 10; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:31,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:31,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:31,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:31,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:31,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:31,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:31,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:31,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:31,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:31,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:31,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:31,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:31,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:31,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:31,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:31,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:31,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:31,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:31,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:31,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:31,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:31,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:31,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:31,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:31,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:31,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:31,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:31,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:31,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:31,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:31,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:31,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:31,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:31,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:31,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:31,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-14 19:21:31,210 INFO L273 TraceCheckUtils]: 41: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-14 19:21:31,211 INFO L273 TraceCheckUtils]: 42: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-14 19:21:31,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume true; {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-14 19:21:31,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !(~x~0 % 4294967296 >= 10); {2693#false} is VALID [2018-11-14 19:21:31,213 INFO L256 TraceCheckUtils]: 45: Hoare triple {2693#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2693#false} is VALID [2018-11-14 19:21:31,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-14 19:21:31,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {2693#false} assume ~cond == 0; {2693#false} is VALID [2018-11-14 19:21:31,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-14 19:21:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:31,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:31,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 19:21:31,238 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-11-14 19:21:31,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:31,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 19:21:31,296 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-14 19:21:31,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 19:21:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 19:21:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-11-14 19:21:31,298 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 23 states. [2018-11-14 19:21:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:32,730 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-14 19:21:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 19:21:32,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-11-14 19:21:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 19:21:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2018-11-14 19:21:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 19:21:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2018-11-14 19:21:32,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2018-11-14 19:21:32,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:32,796 INFO L225 Difference]: With dead ends: 59 [2018-11-14 19:21:32,796 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 19:21:32,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-11-14 19:21:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 19:21:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-14 19:21:32,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:32,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-14 19:21:32,843 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 19:21:32,843 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 19:21:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:32,844 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 19:21:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 19:21:32,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:32,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:32,845 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 19:21:32,845 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 19:21:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:32,846 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-14 19:21:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 19:21:32,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:32,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:32,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:32,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:21:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-14 19:21:32,847 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 49 [2018-11-14 19:21:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:32,848 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-14 19:21:32,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 19:21:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-14 19:21:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 19:21:32,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:32,848 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:32,849 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:32,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1793453738, now seen corresponding path program 11 times [2018-11-14 19:21:32,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:32,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:21:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:34,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {3140#true} call ULTIMATE.init(); {3140#true} is VALID [2018-11-14 19:21:34,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {3140#true} assume true; {3140#true} is VALID [2018-11-14 19:21:34,038 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3140#true} {3140#true} #32#return; {3140#true} is VALID [2018-11-14 19:21:34,038 INFO L256 TraceCheckUtils]: 3: Hoare triple {3140#true} call #t~ret0 := main(); {3140#true} is VALID [2018-11-14 19:21:34,040 INFO L273 TraceCheckUtils]: 4: Hoare triple {3140#true} ~x~0 := 10; {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:34,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:34,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:34,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:34,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:34,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:34,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:34,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:34,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:34,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:34,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:34,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:34,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:34,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:34,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:34,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:34,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:34,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-14 19:21:34,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:34,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-14 19:21:34,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:34,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-14 19:21:34,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:34,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-14 19:21:34,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:34,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-14 19:21:34,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:34,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-14 19:21:34,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:34,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-14 19:21:34,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:34,093 INFO L273 TraceCheckUtils]: 35: Hoare triple {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-14 19:21:34,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:34,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-14 19:21:34,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:34,095 INFO L273 TraceCheckUtils]: 39: Hoare triple {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-14 19:21:34,096 INFO L273 TraceCheckUtils]: 40: Hoare triple {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-14 19:21:34,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-14 19:21:34,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-14 19:21:34,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume true; {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-14 19:21:34,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-14 19:21:34,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume true; {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-14 19:21:34,101 INFO L273 TraceCheckUtils]: 46: Hoare triple {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := ~x~0 + 2; {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} is VALID [2018-11-14 19:21:34,101 INFO L273 TraceCheckUtils]: 47: Hoare triple {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} assume true; {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} is VALID [2018-11-14 19:21:34,102 INFO L273 TraceCheckUtils]: 48: Hoare triple {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {3141#false} is VALID [2018-11-14 19:21:34,103 INFO L256 TraceCheckUtils]: 49: Hoare triple {3141#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {3141#false} is VALID [2018-11-14 19:21:34,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {3141#false} ~cond := #in~cond; {3141#false} is VALID [2018-11-14 19:21:34,103 INFO L273 TraceCheckUtils]: 51: Hoare triple {3141#false} assume ~cond == 0; {3141#false} is VALID [2018-11-14 19:21:34,103 INFO L273 TraceCheckUtils]: 52: Hoare triple {3141#false} assume !false; {3141#false} is VALID [2018-11-14 19:21:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:34,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:34,108 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-14 19:21:34,118 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1