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/phases_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:20:10,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:20:10,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:20:10,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:20:10,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:20:10,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:20:10,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:20:10,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:20:10,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:20:10,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:20:10,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:20:10,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:20:10,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:20:10,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:20:10,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:20:10,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:20:10,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:20:10,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:20:10,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:20:10,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:20:10,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:20:10,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:20:10,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:20:10,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:20:10,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:20:10,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:20:10,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:20:10,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:20:10,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:20:10,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:20:10,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:20:10,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:20:10,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:20:10,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:20:10,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:20:10,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:20:10,875 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:10,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:20:10,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:20:10,898 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:20:10,898 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:20:10,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:20:10,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:20:10,899 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:20:10,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:20:10,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:20:10,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:20:10,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:20:10,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:20:10,901 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:20:10,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:20:10,901 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:20:10,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:20:10,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:20:10,902 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:20:10,902 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:20:10,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:20:10,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:20:10,903 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:20:10,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:20:10,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:20:10,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:20:10,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:20:10,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:20:10,904 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:20:10,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:20:10,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:20:10,904 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:20:10,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:20:10,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:20:10,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:20:10,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:20:10,994 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:20:10,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call1.i [2018-11-14 19:20:11,064 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ed6494f/29adedba9b0b48e4b7f7203491bfb88b/FLAGd67c27e6a [2018-11-14 19:20:11,461 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:20:11,462 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call1.i [2018-11-14 19:20:11,468 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ed6494f/29adedba9b0b48e4b7f7203491bfb88b/FLAGd67c27e6a [2018-11-14 19:20:11,483 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ed6494f/29adedba9b0b48e4b7f7203491bfb88b [2018-11-14 19:20:11,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:20:11,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:20:11,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:11,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:20:11,503 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:20:11,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:11" (1/1) ... [2018-11-14 19:20:11,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47882b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:11, skipping insertion in model container [2018-11-14 19:20:11,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:11" (1/1) ... [2018-11-14 19:20:11,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:20:11,542 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:20:11,782 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:11,788 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:20:11,806 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:11,822 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:20:11,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:11 WrapperNode [2018-11-14 19:20:11,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:11,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:20:11,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:20:11,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:20:11,839 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:11" (1/1) ... [2018-11-14 19:20:11,839 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:11" (1/1) ... [2018-11-14 19:20:11,845 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:11" (1/1) ... [2018-11-14 19:20:11,846 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:11" (1/1) ... [2018-11-14 19:20:11,852 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:11" (1/1) ... [2018-11-14 19:20:11,858 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:11" (1/1) ... [2018-11-14 19:20:11,859 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:11" (1/1) ... [2018-11-14 19:20:11,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:20:11,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:20:11,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:20:11,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:20:11,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:11" (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:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:20:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:20:12,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:20:12,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:20:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:20:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:20:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:20:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:20:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:20:12,456 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:20:12,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:12 BoogieIcfgContainer [2018-11-14 19:20:12,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:20:12,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:20:12,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:20:12,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:20:12,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:20:11" (1/3) ... [2018-11-14 19:20:12,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51802463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:12, skipping insertion in model container [2018-11-14 19:20:12,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:11" (2/3) ... [2018-11-14 19:20:12,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51802463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:12, skipping insertion in model container [2018-11-14 19:20:12,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:12" (3/3) ... [2018-11-14 19:20:12,464 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call1.i [2018-11-14 19:20:12,474 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:20:12,483 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:20:12,501 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:20:12,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:20:12,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:20:12,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:20:12,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:20:12,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:20:12,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:20:12,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:20:12,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:20:12,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:20:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-14 19:20:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:20:12,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:12,559 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:12,561 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:12,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-14 19:20:12,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:12,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:12,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-14 19:20:12,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-14 19:20:12,678 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-14 19:20:12,678 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-14 19:20:12,678 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2018-11-14 19:20:12,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-14 19:20:12,680 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#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)); {23#false} is VALID [2018-11-14 19:20:12,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-14 19:20:12,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~cond == 0; {23#false} is VALID [2018-11-14 19:20:12,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-14 19:20:12,684 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:12,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:12,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:20:12,691 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:12,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:12,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:20:12,788 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:12,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:20:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:20:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:20:12,799 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-14 19:20:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:12,872 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 19:20:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:20:12,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 19:20:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 19:20:12,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-14 19:20:13,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:13,123 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:20:13,124 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 19:20:13,127 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:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 19:20:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 19:20:13,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:13,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 19:20:13,238 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 19:20:13,238 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 19:20:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,241 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-14 19:20:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-14 19:20:13,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,242 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 19:20:13,243 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 19:20:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,246 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-14 19:20:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-14 19:20:13,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:13,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:20:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-14 19:20:13,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-14 19:20:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:13,252 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-14 19:20:13,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:20:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-14 19:20:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:20:13,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:13,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:13,254 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:13,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-14 19:20:13,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:13,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:13,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-14 19:20:13,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-14 19:20:13,510 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #38#return; {111#true} is VALID [2018-11-14 19:20:13,510 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret1 := main(); {111#true} is VALID [2018-11-14 19:20:13,511 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} ~x~0 := 0; {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:13,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:13,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {112#false} is VALID [2018-11-14 19:20:13,513 INFO L256 TraceCheckUtils]: 7: Hoare triple {112#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)); {112#false} is VALID [2018-11-14 19:20:13,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {112#false} ~cond := #in~cond; {112#false} is VALID [2018-11-14 19:20:13,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume ~cond == 0; {112#false} is VALID [2018-11-14 19:20:13,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-14 19:20:13,515 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:13,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:13,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:20:13,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:13,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:13,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:20:13,555 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:13,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:20:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:20:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:20:13,556 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-14 19:20:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,685 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-14 19:20:13,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:20:13,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-14 19:20:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-14 19:20:13,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2018-11-14 19:20:13,825 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,827 INFO L225 Difference]: With dead ends: 24 [2018-11-14 19:20:13,827 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 19:20:13,828 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:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 19:20:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 19:20:13,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:13,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:13,839 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:13,839 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,842 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-14 19:20:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-14 19:20:13,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,843 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:13,843 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:13,845 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-14 19:20:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-14 19:20:13,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:13,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:13,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:13,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:20:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-14 19:20:13,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-14 19:20:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:13,849 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-14 19:20:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:20:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-14 19:20:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 19:20:13,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:13,850 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:13,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:13,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-14 19:20:13,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:14,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-14 19:20:14,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-14 19:20:14,052 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #38#return; {207#true} is VALID [2018-11-14 19:20:14,052 INFO L256 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret1 := main(); {207#true} is VALID [2018-11-14 19:20:14,061 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 0; {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:14,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:14,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:14,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {210#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:14,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {210#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {210#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:14,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {210#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {208#false} is VALID [2018-11-14 19:20:14,085 INFO L256 TraceCheckUtils]: 10: Hoare triple {208#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)); {208#false} is VALID [2018-11-14 19:20:14,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2018-11-14 19:20:14,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume ~cond == 0; {208#false} is VALID [2018-11-14 19:20:14,086 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-14 19:20:14,091 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:14,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:14,091 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:14,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:14,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:14,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-14 19:20:14,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-14 19:20:14,757 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #38#return; {207#true} is VALID [2018-11-14 19:20:14,757 INFO L256 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret1 := main(); {207#true} is VALID [2018-11-14 19:20:14,758 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 0; {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:14,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:14,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:14,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {235#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:14,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {235#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {235#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:14,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {235#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {208#false} is VALID [2018-11-14 19:20:14,766 INFO L256 TraceCheckUtils]: 10: Hoare triple {208#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)); {208#false} is VALID [2018-11-14 19:20:14,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2018-11-14 19:20:14,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume ~cond == 0; {208#false} is VALID [2018-11-14 19:20:14,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-14 19:20:14,769 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:14,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:14,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 19:20:14,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 19:20:14,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:14,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:20:14,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:14,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:20:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:20:14,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:20:14,825 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2018-11-14 19:20:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:15,075 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 19:20:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:20:15,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 19:20:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:20:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-14 19:20:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:20:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-14 19:20:15,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2018-11-14 19:20:15,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:15,131 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:20:15,132 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 19:20:15,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:20:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 19:20:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 19:20:15,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:15,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:15,159 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:15,160 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:15,162 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:20:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:20:15,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:15,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:15,163 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:15,163 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 19:20:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:15,165 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-14 19:20:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:20:15,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:15,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:15,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:15,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:20:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-14 19:20:15,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-14 19:20:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:15,168 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-14 19:20:15,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:20:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-14 19:20:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:20:15,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:15,169 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:15,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:15,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-14 19:20:15,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:15,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:15,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:15,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:15,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:15,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2018-11-14 19:20:15,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2018-11-14 19:20:15,376 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #38#return; {358#true} is VALID [2018-11-14 19:20:15,377 INFO L256 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2018-11-14 19:20:15,380 INFO L273 TraceCheckUtils]: 4: Hoare triple {358#true} ~x~0 := 0; {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:15,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:15,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:15,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:15,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:15,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:15,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {362#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:15,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {362#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {362#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:15,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {362#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {359#false} is VALID [2018-11-14 19:20:15,387 INFO L256 TraceCheckUtils]: 13: Hoare triple {359#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)); {359#false} is VALID [2018-11-14 19:20:15,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2018-11-14 19:20:15,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {359#false} assume ~cond == 0; {359#false} is VALID [2018-11-14 19:20:15,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {359#false} assume !false; {359#false} is VALID [2018-11-14 19:20:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:15,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:15,390 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:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:20:15,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:20:15,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:15,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:15,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2018-11-14 19:20:15,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {358#true} assume true; {358#true} is VALID [2018-11-14 19:20:15,592 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} #38#return; {358#true} is VALID [2018-11-14 19:20:15,592 INFO L256 TraceCheckUtils]: 3: Hoare triple {358#true} call #t~ret1 := main(); {358#true} is VALID [2018-11-14 19:20:15,598 INFO L273 TraceCheckUtils]: 4: Hoare triple {358#true} ~x~0 := 0; {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:15,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:15,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:15,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:15,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:15,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:15,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {361#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:15,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:15,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {359#false} is VALID [2018-11-14 19:20:15,614 INFO L256 TraceCheckUtils]: 13: Hoare triple {359#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)); {359#false} is VALID [2018-11-14 19:20:15,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2018-11-14 19:20:15,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {359#false} assume ~cond == 0; {359#false} is VALID [2018-11-14 19:20:15,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {359#false} assume !false; {359#false} is VALID [2018-11-14 19:20:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 19:20:15,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:20:15,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:15,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:20:15,679 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:15,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:20:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:20:15,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:20:15,680 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-14 19:20:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:15,951 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 19:20:15,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:20:15,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 19:20:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:20:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-14 19:20:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:20:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-14 19:20:15,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-14 19:20:16,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:16,056 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:20:16,056 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:20:16,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:20:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:20:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 19:20:16,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:16,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:16,082 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:16,082 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:16,084 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 19:20:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 19:20:16,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:16,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:16,085 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:16,085 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:20:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:16,087 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 19:20:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 19:20:16,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:16,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:16,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:16,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:20:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-14 19:20:16,089 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2018-11-14 19:20:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:16,090 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-14 19:20:16,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:20:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 19:20:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:20:16,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:16,091 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:16,091 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:16,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash 26004059, now seen corresponding path program 3 times [2018-11-14 19:20:16,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:16,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:16,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:16,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2018-11-14 19:20:16,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-14 19:20:16,364 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {533#true} {533#true} #38#return; {533#true} is VALID [2018-11-14 19:20:16,364 INFO L256 TraceCheckUtils]: 3: Hoare triple {533#true} call #t~ret1 := main(); {533#true} is VALID [2018-11-14 19:20:16,372 INFO L273 TraceCheckUtils]: 4: Hoare triple {533#true} ~x~0 := 0; {535#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:16,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {535#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {535#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:16,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {535#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {535#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:16,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {535#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {536#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:16,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {536#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {536#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:16,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {536#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {536#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:16,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {536#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {537#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:16,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {537#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:16,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {537#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {537#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:16,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {537#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {538#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:16,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {538#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {538#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:16,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {538#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {534#false} is VALID [2018-11-14 19:20:16,383 INFO L256 TraceCheckUtils]: 16: Hoare triple {534#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)); {534#false} is VALID [2018-11-14 19:20:16,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {534#false} ~cond := #in~cond; {534#false} is VALID [2018-11-14 19:20:16,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {534#false} assume ~cond == 0; {534#false} is VALID [2018-11-14 19:20:16,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {534#false} assume !false; {534#false} is VALID [2018-11-14 19:20:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:16,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:16,386 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:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:20:16,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:20:16,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:16,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:16,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2018-11-14 19:20:16,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-14 19:20:16,510 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {533#true} {533#true} #38#return; {533#true} is VALID [2018-11-14 19:20:16,510 INFO L256 TraceCheckUtils]: 3: Hoare triple {533#true} call #t~ret1 := main(); {533#true} is VALID [2018-11-14 19:20:16,510 INFO L273 TraceCheckUtils]: 4: Hoare triple {533#true} ~x~0 := 0; {533#true} is VALID [2018-11-14 19:20:16,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-14 19:20:16,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {533#true} assume !!(~x~0 % 4294967296 < 268435455); {533#true} is VALID [2018-11-14 19:20:16,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {533#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {533#true} is VALID [2018-11-14 19:20:16,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-14 19:20:16,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {533#true} assume !!(~x~0 % 4294967296 < 268435455); {533#true} is VALID [2018-11-14 19:20:16,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {533#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {533#true} is VALID [2018-11-14 19:20:16,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-14 19:20:16,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {533#true} assume !!(~x~0 % 4294967296 < 268435455); {533#true} is VALID [2018-11-14 19:20:16,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {533#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {581#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:20:16,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {581#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume true; {581#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:20:16,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {581#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {534#false} is VALID [2018-11-14 19:20:16,517 INFO L256 TraceCheckUtils]: 16: Hoare triple {534#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)); {534#false} is VALID [2018-11-14 19:20:16,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {534#false} ~cond := #in~cond; {534#false} is VALID [2018-11-14 19:20:16,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {534#false} assume ~cond == 0; {534#false} is VALID [2018-11-14 19:20:16,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {534#false} assume !false; {534#false} is VALID [2018-11-14 19:20:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 19:20:16,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:20:16,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-14 19:20:16,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:20:16,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:16,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:20:16,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:16,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:20:16,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:20:16,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:20:16,609 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-11-14 19:20:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:16,821 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-14 19:20:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:20:16,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 19:20:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 19:20:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 19:20:16,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2018-11-14 19:20:16,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:16,926 INFO L225 Difference]: With dead ends: 36 [2018-11-14 19:20:16,926 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 19:20:16,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:20:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 19:20:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-14 19:20:16,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:16,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-14 19:20:16,961 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-14 19:20:16,962 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-14 19:20:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:16,964 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 19:20:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 19:20:16,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:16,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:16,965 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-14 19:20:16,965 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-14 19:20:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:16,967 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 19:20:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 19:20:16,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:16,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:16,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:16,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:20:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-14 19:20:16,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2018-11-14 19:20:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:16,971 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-14 19:20:16,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:20:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 19:20:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 19:20:16,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:16,972 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:16,972 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:16,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:16,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1956763133, now seen corresponding path program 1 times [2018-11-14 19:20:16,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:16,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:16,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:16,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:16,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:17,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2018-11-14 19:20:17,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2018-11-14 19:20:17,607 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #38#return; {747#true} is VALID [2018-11-14 19:20:17,608 INFO L256 TraceCheckUtils]: 3: Hoare triple {747#true} call #t~ret1 := main(); {747#true} is VALID [2018-11-14 19:20:17,610 INFO L273 TraceCheckUtils]: 4: Hoare triple {747#true} ~x~0 := 0; {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:17,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:17,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:17,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:17,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:17,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:17,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:17,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:17,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:17,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:17,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:17,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:17,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:17,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:17,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:17,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {754#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:17,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {754#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {754#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:17,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {754#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {748#false} is VALID [2018-11-14 19:20:17,630 INFO L256 TraceCheckUtils]: 22: Hoare triple {748#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)); {748#false} is VALID [2018-11-14 19:20:17,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2018-11-14 19:20:17,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {748#false} assume ~cond == 0; {748#false} is VALID [2018-11-14 19:20:17,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {748#false} assume !false; {748#false} is VALID [2018-11-14 19:20:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:17,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:17,633 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:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:17,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:18,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {747#true} is VALID [2018-11-14 19:20:18,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2018-11-14 19:20:18,044 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #38#return; {747#true} is VALID [2018-11-14 19:20:18,045 INFO L256 TraceCheckUtils]: 3: Hoare triple {747#true} call #t~ret1 := main(); {747#true} is VALID [2018-11-14 19:20:18,046 INFO L273 TraceCheckUtils]: 4: Hoare triple {747#true} ~x~0 := 0; {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:18,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:18,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:18,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {749#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:18,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:18,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:18,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {750#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:18,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:18,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:18,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {751#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:18,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:18,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:18,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {752#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:18,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:18,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:18,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {753#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {748#false} is VALID [2018-11-14 19:20:18,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#false} assume true; {748#false} is VALID [2018-11-14 19:20:18,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {748#false} assume !(~x~0 % 4294967296 < 268435455); {748#false} is VALID [2018-11-14 19:20:18,060 INFO L256 TraceCheckUtils]: 22: Hoare triple {748#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)); {748#false} is VALID [2018-11-14 19:20:18,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {748#false} ~cond := #in~cond; {748#false} is VALID [2018-11-14 19:20:18,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {748#false} assume ~cond == 0; {748#false} is VALID [2018-11-14 19:20:18,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {748#false} assume !false; {748#false} is VALID [2018-11-14 19:20:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-14 19:20:18,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-14 19:20:18,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:18,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:20:18,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:18,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:20:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:20:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:20:18,120 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-14 19:20:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:18,402 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 19:20:18,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:20:18,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-14 19:20:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:20:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-14 19:20:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:20:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-14 19:20:18,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2018-11-14 19:20:18,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:18,493 INFO L225 Difference]: With dead ends: 43 [2018-11-14 19:20:18,493 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 19:20:18,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:20:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 19:20:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 19:20:18,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:18,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 19:20:18,520 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:20:18,521 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:20:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:18,523 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-14 19:20:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-14 19:20:18,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:18,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:18,524 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 19:20:18,524 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 19:20:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:18,526 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-14 19:20:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-14 19:20:18,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:18,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:18,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:18,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:20:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-14 19:20:18,529 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 26 [2018-11-14 19:20:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:18,530 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-14 19:20:18,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:20:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-14 19:20:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 19:20:18,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:18,531 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:18,531 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:18,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 86905629, now seen corresponding path program 2 times [2018-11-14 19:20:18,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:18,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:18,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:18,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {1006#true} call ULTIMATE.init(); {1006#true} is VALID [2018-11-14 19:20:18,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 19:20:18,941 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1006#true} {1006#true} #38#return; {1006#true} is VALID [2018-11-14 19:20:18,941 INFO L256 TraceCheckUtils]: 3: Hoare triple {1006#true} call #t~ret1 := main(); {1006#true} is VALID [2018-11-14 19:20:18,942 INFO L273 TraceCheckUtils]: 4: Hoare triple {1006#true} ~x~0 := 0; {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:18,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:18,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:18,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:18,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:18,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:18,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:18,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:18,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:18,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:18,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:18,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:18,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:18,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:18,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:18,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:18,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:18,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:18,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:18,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:18,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:18,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1015#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:18,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {1015#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1015#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:18,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {1015#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1007#false} is VALID [2018-11-14 19:20:18,965 INFO L256 TraceCheckUtils]: 28: Hoare triple {1007#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)); {1007#false} is VALID [2018-11-14 19:20:18,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {1007#false} ~cond := #in~cond; {1007#false} is VALID [2018-11-14 19:20:18,966 INFO L273 TraceCheckUtils]: 30: Hoare triple {1007#false} assume ~cond == 0; {1007#false} is VALID [2018-11-14 19:20:18,966 INFO L273 TraceCheckUtils]: 31: Hoare triple {1007#false} assume !false; {1007#false} is VALID [2018-11-14 19:20:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:18,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:18,970 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:18,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:20:18,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:20:18,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:19,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:19,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {1006#true} call ULTIMATE.init(); {1006#true} is VALID [2018-11-14 19:20:19,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 19:20:19,225 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1006#true} {1006#true} #38#return; {1006#true} is VALID [2018-11-14 19:20:19,226 INFO L256 TraceCheckUtils]: 3: Hoare triple {1006#true} call #t~ret1 := main(); {1006#true} is VALID [2018-11-14 19:20:19,230 INFO L273 TraceCheckUtils]: 4: Hoare triple {1006#true} ~x~0 := 0; {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:19,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:19,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:19,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {1008#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:19,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:19,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:19,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {1009#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:19,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:19,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:19,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {1010#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:19,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:19,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:19,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1011#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:19,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:19,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:19,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {1012#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:19,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:19,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:19,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {1013#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:19,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:19,250 INFO L273 TraceCheckUtils]: 24: Hoare triple {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:19,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {1014#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1094#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:19,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {1094#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1094#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:19,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {1094#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {1007#false} is VALID [2018-11-14 19:20:19,253 INFO L256 TraceCheckUtils]: 28: Hoare triple {1007#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)); {1007#false} is VALID [2018-11-14 19:20:19,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {1007#false} ~cond := #in~cond; {1007#false} is VALID [2018-11-14 19:20:19,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {1007#false} assume ~cond == 0; {1007#false} is VALID [2018-11-14 19:20:19,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {1007#false} assume !false; {1007#false} is VALID [2018-11-14 19:20:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:19,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 19:20:19,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-14 19:20:19,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:19,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:20:19,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:19,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:20:19,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:20:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:20:19,319 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-14 19:20:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:19,852 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 19:20:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:20:19,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-14 19:20:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:20:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-14 19:20:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:20:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-14 19:20:19,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2018-11-14 19:20:19,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:19,914 INFO L225 Difference]: With dead ends: 49 [2018-11-14 19:20:19,915 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:20:19,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:20:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:20:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-14 19:20:19,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:19,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-14 19:20:19,968 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 19:20:19,968 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 19:20:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:19,970 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-14 19:20:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-14 19:20:19,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:19,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:19,971 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-14 19:20:19,972 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-14 19:20:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:19,973 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-14 19:20:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-14 19:20:19,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:19,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:19,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:19,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 19:20:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-14 19:20:19,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2018-11-14 19:20:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:19,977 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-14 19:20:19,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:20:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-14 19:20:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 19:20:19,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:19,979 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:19,979 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:19,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1973418045, now seen corresponding path program 3 times [2018-11-14 19:20:19,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:19,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:19,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:19,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:19,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:20,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {1314#true} call ULTIMATE.init(); {1314#true} is VALID [2018-11-14 19:20:20,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,621 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1314#true} {1314#true} #38#return; {1314#true} is VALID [2018-11-14 19:20:20,621 INFO L256 TraceCheckUtils]: 3: Hoare triple {1314#true} call #t~ret1 := main(); {1314#true} is VALID [2018-11-14 19:20:20,622 INFO L273 TraceCheckUtils]: 4: Hoare triple {1314#true} ~x~0 := 0; {1316#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:20,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {1316#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1316#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:20,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {1316#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1316#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:20,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {1316#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1317#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:20,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {1317#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1317#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:20,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {1317#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1317#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:20,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {1317#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1318#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:20,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {1318#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1318#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:20,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {1318#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1318#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:20,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1318#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1319#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:20,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {1319#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1319#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:20,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {1319#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1319#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:20,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {1319#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1320#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:20,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {1320#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1320#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:20,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {1320#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1320#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:20,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {1320#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1321#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:20,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {1321#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1321#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:20,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {1321#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1321#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:20,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {1321#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1322#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:20,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {1322#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1322#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:20,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {1322#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1322#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:20,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {1322#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1323#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:20,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {1323#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1323#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:20,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {1323#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1323#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:20,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {1323#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1324#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:20,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {1324#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1324#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:20,659 INFO L273 TraceCheckUtils]: 30: Hoare triple {1324#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1324#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:20,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {1324#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1325#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:20,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {1325#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1325#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:20,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {1325#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1315#false} is VALID [2018-11-14 19:20:20,661 INFO L256 TraceCheckUtils]: 34: Hoare triple {1315#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)); {1315#false} is VALID [2018-11-14 19:20:20,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {1315#false} ~cond := #in~cond; {1315#false} is VALID [2018-11-14 19:20:20,662 INFO L273 TraceCheckUtils]: 36: Hoare triple {1315#false} assume ~cond == 0; {1315#false} is VALID [2018-11-14 19:20:20,662 INFO L273 TraceCheckUtils]: 37: Hoare triple {1315#false} assume !false; {1315#false} is VALID [2018-11-14 19:20:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:20,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:20,667 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:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:20:20,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 19:20:20,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:20,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:20,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {1314#true} call ULTIMATE.init(); {1314#true} is VALID [2018-11-14 19:20:20,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,815 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1314#true} {1314#true} #38#return; {1314#true} is VALID [2018-11-14 19:20:20,815 INFO L256 TraceCheckUtils]: 3: Hoare triple {1314#true} call #t~ret1 := main(); {1314#true} is VALID [2018-11-14 19:20:20,816 INFO L273 TraceCheckUtils]: 4: Hoare triple {1314#true} ~x~0 := 0; {1314#true} is VALID [2018-11-14 19:20:20,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1314#true} is VALID [2018-11-14 19:20:20,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {1314#true} assume true; {1314#true} is VALID [2018-11-14 19:20:20,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {1314#true} assume !!(~x~0 % 4294967296 < 268435455); {1314#true} is VALID [2018-11-14 19:20:20,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {1314#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1413#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:20:20,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {1413#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume true; {1413#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:20:20,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {1413#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {1413#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:20:20,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {1413#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1423#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:20:20,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {1423#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume true; {1423#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:20:20,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {1423#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {1315#false} is VALID [2018-11-14 19:20:20,826 INFO L256 TraceCheckUtils]: 34: Hoare triple {1315#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)); {1315#false} is VALID [2018-11-14 19:20:20,826 INFO L273 TraceCheckUtils]: 35: Hoare triple {1315#false} ~cond := #in~cond; {1315#false} is VALID [2018-11-14 19:20:20,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {1315#false} assume ~cond == 0; {1315#false} is VALID [2018-11-14 19:20:20,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {1315#false} assume !false; {1315#false} is VALID [2018-11-14 19:20:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-14 19:20:20,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:20,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-11-14 19:20:20,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-14 19:20:20,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:20,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 19:20:20,945 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:20:20,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 19:20:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 19:20:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:20:20,946 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2018-11-14 19:20:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:22,363 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 19:20:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 19:20:22,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-14 19:20:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:20:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2018-11-14 19:20:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:20:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 68 transitions. [2018-11-14 19:20:22,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 68 transitions. [2018-11-14 19:20:22,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:22,489 INFO L225 Difference]: With dead ends: 62 [2018-11-14 19:20:22,489 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 19:20:22,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:20:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 19:20:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-14 19:20:22,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:22,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 48 states. [2018-11-14 19:20:22,526 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 48 states. [2018-11-14 19:20:22,527 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 48 states. [2018-11-14 19:20:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:22,530 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-14 19:20:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 19:20:22,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:22,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:22,531 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 52 states. [2018-11-14 19:20:22,531 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 52 states. [2018-11-14 19:20:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:22,533 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-14 19:20:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-14 19:20:22,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:22,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:22,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:22,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 19:20:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-14 19:20:22,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 38 [2018-11-14 19:20:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:22,536 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-14 19:20:22,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 19:20:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 19:20:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 19:20:22,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:22,538 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:22,538 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:22,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash 20842974, now seen corresponding path program 4 times [2018-11-14 19:20:22,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:22,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:23,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {1702#true} call ULTIMATE.init(); {1702#true} is VALID [2018-11-14 19:20:23,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {1702#true} assume true; {1702#true} is VALID [2018-11-14 19:20:23,094 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1702#true} {1702#true} #38#return; {1702#true} is VALID [2018-11-14 19:20:23,094 INFO L256 TraceCheckUtils]: 3: Hoare triple {1702#true} call #t~ret1 := main(); {1702#true} is VALID [2018-11-14 19:20:23,095 INFO L273 TraceCheckUtils]: 4: Hoare triple {1702#true} ~x~0 := 0; {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:23,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:23,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:23,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:23,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:23,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:23,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:23,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:23,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:23,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:23,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:23,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:23,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:23,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:23,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:23,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:23,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:23,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:23,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:23,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:23,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:23,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:23,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:23,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:23,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:23,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:23,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:23,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:23,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:23,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:23,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:23,126 INFO L273 TraceCheckUtils]: 35: Hoare triple {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:23,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:23,127 INFO L273 TraceCheckUtils]: 37: Hoare triple {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:23,128 INFO L273 TraceCheckUtils]: 38: Hoare triple {1715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:23,128 INFO L273 TraceCheckUtils]: 39: Hoare triple {1715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:23,129 INFO L273 TraceCheckUtils]: 40: Hoare triple {1715#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1716#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:23,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {1716#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1716#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:23,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {1716#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1703#false} is VALID [2018-11-14 19:20:23,131 INFO L256 TraceCheckUtils]: 43: Hoare triple {1703#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)); {1703#false} is VALID [2018-11-14 19:20:23,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2018-11-14 19:20:23,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {1703#false} assume ~cond == 0; {1703#false} is VALID [2018-11-14 19:20:23,132 INFO L273 TraceCheckUtils]: 46: Hoare triple {1703#false} assume !false; {1703#false} is VALID [2018-11-14 19:20:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:23,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:23,137 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:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:20:23,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:20:23,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:23,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:23,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {1702#true} call ULTIMATE.init(); {1702#true} is VALID [2018-11-14 19:20:23,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {1702#true} assume true; {1702#true} is VALID [2018-11-14 19:20:23,303 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1702#true} {1702#true} #38#return; {1702#true} is VALID [2018-11-14 19:20:23,303 INFO L256 TraceCheckUtils]: 3: Hoare triple {1702#true} call #t~ret1 := main(); {1702#true} is VALID [2018-11-14 19:20:23,304 INFO L273 TraceCheckUtils]: 4: Hoare triple {1702#true} ~x~0 := 0; {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:23,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:23,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:23,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {1704#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:23,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:23,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:23,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:23,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:23,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:23,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {1706#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:23,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:23,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:23,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:23,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:23,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:23,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {1708#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:23,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:23,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:23,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {1709#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:23,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:23,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:23,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:23,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:23,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:23,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:23,393 INFO L273 TraceCheckUtils]: 29: Hoare triple {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:23,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:23,395 INFO L273 TraceCheckUtils]: 31: Hoare triple {1712#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:23,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:23,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:23,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {1713#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:23,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:23,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:23,399 INFO L273 TraceCheckUtils]: 37: Hoare triple {1714#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1703#false} is VALID [2018-11-14 19:20:23,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {1703#false} assume true; {1703#false} is VALID [2018-11-14 19:20:23,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {1703#false} assume !!(~x~0 % 4294967296 < 268435455); {1703#false} is VALID [2018-11-14 19:20:23,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {1703#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {1703#false} is VALID [2018-11-14 19:20:23,400 INFO L273 TraceCheckUtils]: 41: Hoare triple {1703#false} assume true; {1703#false} is VALID [2018-11-14 19:20:23,401 INFO L273 TraceCheckUtils]: 42: Hoare triple {1703#false} assume !(~x~0 % 4294967296 < 268435455); {1703#false} is VALID [2018-11-14 19:20:23,401 INFO L256 TraceCheckUtils]: 43: Hoare triple {1703#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)); {1703#false} is VALID [2018-11-14 19:20:23,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2018-11-14 19:20:23,401 INFO L273 TraceCheckUtils]: 45: Hoare triple {1703#false} assume ~cond == 0; {1703#false} is VALID [2018-11-14 19:20:23,402 INFO L273 TraceCheckUtils]: 46: Hoare triple {1703#false} assume !false; {1703#false} is VALID [2018-11-14 19:20:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 55 proven. 165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:20:23,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:23,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 15 [2018-11-14 19:20:23,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-14 19:20:23,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:23,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 19:20:23,487 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:20:23,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 19:20:23,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 19:20:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:20:23,487 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 15 states. [2018-11-14 19:20:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:24,417 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-14 19:20:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 19:20:24,417 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-11-14 19:20:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:20:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2018-11-14 19:20:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:20:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2018-11-14 19:20:24,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 61 transitions. [2018-11-14 19:20:24,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:24,490 INFO L225 Difference]: With dead ends: 67 [2018-11-14 19:20:24,491 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 19:20:24,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-14 19:20:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 19:20:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-14 19:20:24,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:24,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-14 19:20:24,551 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 19:20:24,551 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 19:20:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:24,553 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 19:20:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-14 19:20:24,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:24,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:24,554 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 19:20:24,554 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 19:20:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:24,556 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 19:20:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-14 19:20:24,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:24,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:24,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:24,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 19:20:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-14 19:20:24,559 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-11-14 19:20:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:24,559 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-14 19:20:24,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 19:20:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-14 19:20:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 19:20:24,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:24,560 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:24,561 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:24,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash 778125502, now seen corresponding path program 5 times [2018-11-14 19:20:24,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:24,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:24,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:25,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {2133#true} call ULTIMATE.init(); {2133#true} is VALID [2018-11-14 19:20:25,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {2133#true} assume true; {2133#true} is VALID [2018-11-14 19:20:25,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2133#true} {2133#true} #38#return; {2133#true} is VALID [2018-11-14 19:20:25,253 INFO L256 TraceCheckUtils]: 3: Hoare triple {2133#true} call #t~ret1 := main(); {2133#true} is VALID [2018-11-14 19:20:25,254 INFO L273 TraceCheckUtils]: 4: Hoare triple {2133#true} ~x~0 := 0; {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:25,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:25,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:20:25,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:25,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:25,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:20:25,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:25,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:25,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:20:25,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:25,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:25,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:20:25,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:25,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:25,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:20:25,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:25,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:25,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:20:25,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:25,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:25,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:20:25,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:25,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:25,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:20:25,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:25,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:25,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:20:25,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:25,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:25,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:20:25,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:25,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:25,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:20:25,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:20:25,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:20:25,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:20:25,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:25,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:25,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:20:25,283 INFO L273 TraceCheckUtils]: 43: Hoare triple {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:25,284 INFO L273 TraceCheckUtils]: 44: Hoare triple {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:25,285 INFO L273 TraceCheckUtils]: 45: Hoare triple {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:20:25,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2149#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:25,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {2149#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2149#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:25,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {2149#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2134#false} is VALID [2018-11-14 19:20:25,288 INFO L256 TraceCheckUtils]: 49: Hoare triple {2134#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)); {2134#false} is VALID [2018-11-14 19:20:25,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {2134#false} ~cond := #in~cond; {2134#false} is VALID [2018-11-14 19:20:25,288 INFO L273 TraceCheckUtils]: 51: Hoare triple {2134#false} assume ~cond == 0; {2134#false} is VALID [2018-11-14 19:20:25,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {2134#false} assume !false; {2134#false} is VALID [2018-11-14 19:20:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:25,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:25,294 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:20:25,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:21:16,893 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-14 19:21:16,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:17,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:17,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {2133#true} call ULTIMATE.init(); {2133#true} is VALID [2018-11-14 19:21:17,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {2133#true} assume true; {2133#true} is VALID [2018-11-14 19:21:17,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2133#true} {2133#true} #38#return; {2133#true} is VALID [2018-11-14 19:21:17,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {2133#true} call #t~ret1 := main(); {2133#true} is VALID [2018-11-14 19:21:17,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {2133#true} ~x~0 := 0; {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:17,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:17,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:17,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {2135#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:17,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:17,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:17,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {2136#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:17,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:17,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:17,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {2137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:17,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:17,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:17,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {2138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:17,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:17,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:17,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {2139#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:17,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:17,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:17,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {2140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:17,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:17,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:17,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:17,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:17,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:17,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {2142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:17,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:17,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:17,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {2143#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:17,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:17,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:17,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {2144#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:17,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:17,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:17,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {2145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:17,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:17,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:17,694 INFO L273 TraceCheckUtils]: 40: Hoare triple {2146#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:17,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:17,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:17,697 INFO L273 TraceCheckUtils]: 43: Hoare triple {2147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:17,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:17,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:17,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {2148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2134#false} is VALID [2018-11-14 19:21:17,700 INFO L273 TraceCheckUtils]: 47: Hoare triple {2134#false} assume true; {2134#false} is VALID [2018-11-14 19:21:17,700 INFO L273 TraceCheckUtils]: 48: Hoare triple {2134#false} assume !(~x~0 % 4294967296 < 268435455); {2134#false} is VALID [2018-11-14 19:21:17,701 INFO L256 TraceCheckUtils]: 49: Hoare triple {2134#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)); {2134#false} is VALID [2018-11-14 19:21:17,701 INFO L273 TraceCheckUtils]: 50: Hoare triple {2134#false} ~cond := #in~cond; {2134#false} is VALID [2018-11-14 19:21:17,701 INFO L273 TraceCheckUtils]: 51: Hoare triple {2134#false} assume ~cond == 0; {2134#false} is VALID [2018-11-14 19:21:17,702 INFO L273 TraceCheckUtils]: 52: Hoare triple {2134#false} assume !false; {2134#false} is VALID [2018-11-14 19:21:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:17,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-11-14 19:21:17,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-14 19:21:17,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:17,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 19:21:17,836 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:17,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 19:21:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 19:21:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:21:17,837 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 17 states. [2018-11-14 19:21:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:19,137 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-14 19:21:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 19:21:19,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-14 19:21:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:21:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2018-11-14 19:21:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:21:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2018-11-14 19:21:19,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 67 transitions. [2018-11-14 19:21:19,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:19,251 INFO L225 Difference]: With dead ends: 73 [2018-11-14 19:21:19,251 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 19:21:19,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:21:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 19:21:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 19:21:19,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:19,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 19:21:19,295 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 19:21:19,295 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 19:21:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:19,298 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-14 19:21:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 19:21:19,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:19,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:19,298 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 19:21:19,299 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 19:21:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:19,300 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-14 19:21:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 19:21:19,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:19,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:19,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:19,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 19:21:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-14 19:21:19,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2018-11-14 19:21:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:19,302 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-14 19:21:19,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 19:21:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-14 19:21:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 19:21:19,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:19,303 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:19,303 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:19,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1892167778, now seen corresponding path program 6 times [2018-11-14 19:21:19,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:19,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:19,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:19,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:21:19,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:20,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {2612#true} call ULTIMATE.init(); {2612#true} is VALID [2018-11-14 19:21:20,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,264 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2612#true} {2612#true} #38#return; {2612#true} is VALID [2018-11-14 19:21:20,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {2612#true} call #t~ret1 := main(); {2612#true} is VALID [2018-11-14 19:21:20,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {2612#true} ~x~0 := 0; {2614#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:20,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {2614#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2614#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:20,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {2614#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2614#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:20,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {2614#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2615#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:20,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {2615#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2615#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:20,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2615#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:20,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {2615#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:20,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {2616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:20,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {2616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:20,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {2616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2617#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:20,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {2617#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2617#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:20,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {2617#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2617#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:20,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {2617#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:20,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:20,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:20,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2619#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:20,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {2619#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2619#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:20,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {2619#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2619#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:20,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {2619#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2620#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:20,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {2620#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2620#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:20,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {2620#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2620#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:20,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2621#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:20,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {2621#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2621#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:20,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {2621#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2621#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:20,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {2621#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2622#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:20,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {2622#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2622#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:20,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {2622#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2622#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:20,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {2622#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2623#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:20,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {2623#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2623#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:20,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {2623#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {2623#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:20,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {2623#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:20,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {2624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:20,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {2624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:20,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {2624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2625#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:20,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {2625#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2625#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:20,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {2625#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {2625#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:20,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {2625#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:20,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {2626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:20,300 INFO L273 TraceCheckUtils]: 42: Hoare triple {2626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:20,301 INFO L273 TraceCheckUtils]: 43: Hoare triple {2626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2627#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:20,302 INFO L273 TraceCheckUtils]: 44: Hoare triple {2627#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2627#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:20,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {2627#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2627#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:20,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {2627#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2628#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:20,305 INFO L273 TraceCheckUtils]: 47: Hoare triple {2628#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2628#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:20,306 INFO L273 TraceCheckUtils]: 48: Hoare triple {2628#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2628#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:20,307 INFO L273 TraceCheckUtils]: 49: Hoare triple {2628#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2629#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:20,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {2629#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2629#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:20,309 INFO L273 TraceCheckUtils]: 51: Hoare triple {2629#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2629#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:20,310 INFO L273 TraceCheckUtils]: 52: Hoare triple {2629#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2630#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:20,311 INFO L273 TraceCheckUtils]: 53: Hoare triple {2630#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2630#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:20,312 INFO L273 TraceCheckUtils]: 54: Hoare triple {2630#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2613#false} is VALID [2018-11-14 19:21:20,312 INFO L256 TraceCheckUtils]: 55: Hoare triple {2613#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)); {2613#false} is VALID [2018-11-14 19:21:20,312 INFO L273 TraceCheckUtils]: 56: Hoare triple {2613#false} ~cond := #in~cond; {2613#false} is VALID [2018-11-14 19:21:20,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {2613#false} assume ~cond == 0; {2613#false} is VALID [2018-11-14 19:21:20,313 INFO L273 TraceCheckUtils]: 58: Hoare triple {2613#false} assume !false; {2613#false} is VALID [2018-11-14 19:21:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:20,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:20,322 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:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:21:20,456 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-14 19:21:20,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:20,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:20,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {2612#true} call ULTIMATE.init(); {2612#true} is VALID [2018-11-14 19:21:20,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,655 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2612#true} {2612#true} #38#return; {2612#true} is VALID [2018-11-14 19:21:20,655 INFO L256 TraceCheckUtils]: 3: Hoare triple {2612#true} call #t~ret1 := main(); {2612#true} is VALID [2018-11-14 19:21:20,655 INFO L273 TraceCheckUtils]: 4: Hoare triple {2612#true} ~x~0 := 0; {2612#true} is VALID [2018-11-14 19:21:20,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,661 INFO L273 TraceCheckUtils]: 27: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,661 INFO L273 TraceCheckUtils]: 28: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,661 INFO L273 TraceCheckUtils]: 29: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,662 INFO L273 TraceCheckUtils]: 30: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,662 INFO L273 TraceCheckUtils]: 31: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,662 INFO L273 TraceCheckUtils]: 32: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,663 INFO L273 TraceCheckUtils]: 39: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,663 INFO L273 TraceCheckUtils]: 41: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,664 INFO L273 TraceCheckUtils]: 43: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2612#true} is VALID [2018-11-14 19:21:20,664 INFO L273 TraceCheckUtils]: 44: Hoare triple {2612#true} assume true; {2612#true} is VALID [2018-11-14 19:21:20,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {2612#true} assume !!(~x~0 % 4294967296 < 268435455); {2612#true} is VALID [2018-11-14 19:21:20,665 INFO L273 TraceCheckUtils]: 46: Hoare triple {2612#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {2772#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,666 INFO L273 TraceCheckUtils]: 47: Hoare triple {2772#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume true; {2772#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {2772#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {2772#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,667 INFO L273 TraceCheckUtils]: 49: Hoare triple {2772#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2782#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {2782#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume true; {2782#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {2782#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {2782#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,669 INFO L273 TraceCheckUtils]: 52: Hoare triple {2782#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {2792#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,669 INFO L273 TraceCheckUtils]: 53: Hoare triple {2792#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume true; {2792#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-14 19:21:20,670 INFO L273 TraceCheckUtils]: 54: Hoare triple {2792#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {2613#false} is VALID [2018-11-14 19:21:20,671 INFO L256 TraceCheckUtils]: 55: Hoare triple {2613#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)); {2613#false} is VALID [2018-11-14 19:21:20,671 INFO L273 TraceCheckUtils]: 56: Hoare triple {2613#false} ~cond := #in~cond; {2613#false} is VALID [2018-11-14 19:21:20,671 INFO L273 TraceCheckUtils]: 57: Hoare triple {2613#false} assume ~cond == 0; {2613#false} is VALID [2018-11-14 19:21:20,672 INFO L273 TraceCheckUtils]: 58: Hoare triple {2613#false} assume !false; {2613#false} is VALID [2018-11-14 19:21:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 112 proven. 7 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-14 19:21:20,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:20,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2018-11-14 19:21:20,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-11-14 19:21:20,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:20,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 19:21:20,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:20,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 19:21:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 19:21:20,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-14 19:21:20,785 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 22 states. [2018-11-14 19:21:22,465 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-14 19:21:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:25,115 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 19:21:25,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 19:21:25,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-11-14 19:21:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:21:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2018-11-14 19:21:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:21:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2018-11-14 19:21:25,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 90 transitions. [2018-11-14 19:21:27,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:27,418 INFO L225 Difference]: With dead ends: 86 [2018-11-14 19:21:27,418 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 19:21:27,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:21:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 19:21:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-14 19:21:27,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:27,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 69 states. [2018-11-14 19:21:27,522 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 69 states. [2018-11-14 19:21:27,522 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 69 states. [2018-11-14 19:21:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:27,524 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-14 19:21:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-11-14 19:21:27,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:27,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:27,525 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 73 states. [2018-11-14 19:21:27,525 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 73 states. [2018-11-14 19:21:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:27,526 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-14 19:21:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-11-14 19:21:27,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:27,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:27,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:27,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 19:21:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-11-14 19:21:27,528 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 59 [2018-11-14 19:21:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:27,529 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-11-14 19:21:27,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 19:21:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-14 19:21:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 19:21:27,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:27,530 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:27,530 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:27,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1091385629, now seen corresponding path program 7 times [2018-11-14 19:21:27,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:27,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:27,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:21:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:28,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {3176#true} call ULTIMATE.init(); {3176#true} is VALID [2018-11-14 19:21:28,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {3176#true} assume true; {3176#true} is VALID [2018-11-14 19:21:28,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3176#true} {3176#true} #38#return; {3176#true} is VALID [2018-11-14 19:21:28,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {3176#true} call #t~ret1 := main(); {3176#true} is VALID [2018-11-14 19:21:28,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {3176#true} ~x~0 := 0; {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:28,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:28,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:28,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:28,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:28,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:28,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:28,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:28,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:28,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:28,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:28,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:28,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:28,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:28,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:28,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:28,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:28,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:28,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:28,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:28,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:28,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:28,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:28,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:28,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:28,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:28,578 INFO L273 TraceCheckUtils]: 30: Hoare triple {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:28,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:28,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:28,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:28,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:28,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:28,583 INFO L273 TraceCheckUtils]: 39: Hoare triple {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:28,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,584 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,585 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:28,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:28,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:28,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,589 INFO L273 TraceCheckUtils]: 47: Hoare triple {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,591 INFO L273 TraceCheckUtils]: 49: Hoare triple {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:28,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:28,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:28,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,594 INFO L273 TraceCheckUtils]: 53: Hoare triple {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,595 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,596 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:28,596 INFO L273 TraceCheckUtils]: 56: Hoare triple {3195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:28,597 INFO L273 TraceCheckUtils]: 57: Hoare triple {3195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:28,598 INFO L273 TraceCheckUtils]: 58: Hoare triple {3195#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3196#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:28,599 INFO L273 TraceCheckUtils]: 59: Hoare triple {3196#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3196#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:28,599 INFO L273 TraceCheckUtils]: 60: Hoare triple {3196#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3196#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:28,601 INFO L273 TraceCheckUtils]: 61: Hoare triple {3196#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3197#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:28,601 INFO L273 TraceCheckUtils]: 62: Hoare triple {3197#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3197#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:28,602 INFO L273 TraceCheckUtils]: 63: Hoare triple {3197#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3177#false} is VALID [2018-11-14 19:21:28,602 INFO L256 TraceCheckUtils]: 64: Hoare triple {3177#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)); {3177#false} is VALID [2018-11-14 19:21:28,603 INFO L273 TraceCheckUtils]: 65: Hoare triple {3177#false} ~cond := #in~cond; {3177#false} is VALID [2018-11-14 19:21:28,603 INFO L273 TraceCheckUtils]: 66: Hoare triple {3177#false} assume ~cond == 0; {3177#false} is VALID [2018-11-14 19:21:28,603 INFO L273 TraceCheckUtils]: 67: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2018-11-14 19:21:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:28,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:28,615 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:28,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:28,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:28,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {3176#true} call ULTIMATE.init(); {3176#true} is VALID [2018-11-14 19:21:28,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {3176#true} assume true; {3176#true} is VALID [2018-11-14 19:21:28,838 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3176#true} {3176#true} #38#return; {3176#true} is VALID [2018-11-14 19:21:28,838 INFO L256 TraceCheckUtils]: 3: Hoare triple {3176#true} call #t~ret1 := main(); {3176#true} is VALID [2018-11-14 19:21:28,839 INFO L273 TraceCheckUtils]: 4: Hoare triple {3176#true} ~x~0 := 0; {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:28,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:28,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:28,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {3178#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:28,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:28,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:28,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {3179#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:28,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:28,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:28,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {3180#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:28,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:28,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:28,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {3181#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:28,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:28,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:28,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {3182#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:28,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:28,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:28,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {3183#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:28,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:28,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:28,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {3184#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:28,856 INFO L273 TraceCheckUtils]: 26: Hoare triple {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:28,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:28,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {3185#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:28,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:28,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:28,860 INFO L273 TraceCheckUtils]: 31: Hoare triple {3186#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:28,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:28,861 INFO L273 TraceCheckUtils]: 33: Hoare triple {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:28,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {3187#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:28,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {3188#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:28,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:28,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:28,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {3189#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,868 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,869 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:28,870 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:28,870 INFO L273 TraceCheckUtils]: 44: Hoare triple {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:28,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:28,872 INFO L273 TraceCheckUtils]: 46: Hoare triple {3191#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:28,874 INFO L273 TraceCheckUtils]: 49: Hoare triple {3192#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:28,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:28,876 INFO L273 TraceCheckUtils]: 51: Hoare triple {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:28,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {3193#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:28,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {3194#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3177#false} is VALID [2018-11-14 19:21:28,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {3177#false} assume true; {3177#false} is VALID [2018-11-14 19:21:28,880 INFO L273 TraceCheckUtils]: 57: Hoare triple {3177#false} assume !!(~x~0 % 4294967296 < 268435455); {3177#false} is VALID [2018-11-14 19:21:28,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {3177#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3177#false} is VALID [2018-11-14 19:21:28,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {3177#false} assume true; {3177#false} is VALID [2018-11-14 19:21:28,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {3177#false} assume !!(~x~0 % 4294967296 < 268435455); {3177#false} is VALID [2018-11-14 19:21:28,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {3177#false} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3177#false} is VALID [2018-11-14 19:21:28,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {3177#false} assume true; {3177#false} is VALID [2018-11-14 19:21:28,881 INFO L273 TraceCheckUtils]: 63: Hoare triple {3177#false} assume !(~x~0 % 4294967296 < 268435455); {3177#false} is VALID [2018-11-14 19:21:28,881 INFO L256 TraceCheckUtils]: 64: Hoare triple {3177#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)); {3177#false} is VALID [2018-11-14 19:21:28,881 INFO L273 TraceCheckUtils]: 65: Hoare triple {3177#false} ~cond := #in~cond; {3177#false} is VALID [2018-11-14 19:21:28,882 INFO L273 TraceCheckUtils]: 66: Hoare triple {3177#false} assume ~cond == 0; {3177#false} is VALID [2018-11-14 19:21:28,882 INFO L273 TraceCheckUtils]: 67: Hoare triple {3177#false} assume !false; {3177#false} is VALID [2018-11-14 19:21:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 136 proven. 408 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 19:21:28,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:28,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 22 [2018-11-14 19:21:28,910 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-14 19:21:28,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:28,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 19:21:28,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:28,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 19:21:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 19:21:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-14 19:21:28,987 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 22 states. [2018-11-14 19:21:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:32,291 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-11-14 19:21:32,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 19:21:32,292 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-14 19:21:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:21:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2018-11-14 19:21:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:21:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2018-11-14 19:21:32,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 79 transitions. [2018-11-14 19:21:32,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:32,396 INFO L225 Difference]: With dead ends: 91 [2018-11-14 19:21:32,397 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 19:21:32,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-14 19:21:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 19:21:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-14 19:21:32,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:32,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2018-11-14 19:21:32,481 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 19:21:32,481 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 19:21:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:32,482 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 19:21:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 19:21:32,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:32,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:32,483 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2018-11-14 19:21:32,483 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2018-11-14 19:21:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:32,485 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 19:21:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 19:21:32,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:32,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:32,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:32,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 19:21:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-14 19:21:32,488 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 68 [2018-11-14 19:21:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:32,488 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-14 19:21:32,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 19:21:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-14 19:21:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 19:21:32,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:32,489 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:32,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:32,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1574236611, now seen corresponding path program 8 times [2018-11-14 19:21:32,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:32,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:32,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:32,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:21:32,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:33,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3779#true} is VALID [2018-11-14 19:21:33,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2018-11-14 19:21:33,826 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #38#return; {3779#true} is VALID [2018-11-14 19:21:33,826 INFO L256 TraceCheckUtils]: 3: Hoare triple {3779#true} call #t~ret1 := main(); {3779#true} is VALID [2018-11-14 19:21:33,828 INFO L273 TraceCheckUtils]: 4: Hoare triple {3779#true} ~x~0 := 0; {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:33,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:33,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:33,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:33,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:33,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:33,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:33,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:33,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:33,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:33,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:33,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:33,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:33,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:33,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:33,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:33,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:33,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:33,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:33,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:33,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:33,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:33,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:33,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:33,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:33,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:33,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:33,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:33,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:33,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:33,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:33,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:33,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:33,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:33,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:33,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:33,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:33,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:33,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:33,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:33,957 INFO L273 TraceCheckUtils]: 44: Hoare triple {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:33,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:33,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:33,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:33,960 INFO L273 TraceCheckUtils]: 48: Hoare triple {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:33,961 INFO L273 TraceCheckUtils]: 49: Hoare triple {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:33,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:33,962 INFO L273 TraceCheckUtils]: 51: Hoare triple {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:33,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:33,964 INFO L273 TraceCheckUtils]: 53: Hoare triple {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:33,964 INFO L273 TraceCheckUtils]: 54: Hoare triple {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:33,965 INFO L273 TraceCheckUtils]: 55: Hoare triple {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:33,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:33,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:33,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:33,969 INFO L273 TraceCheckUtils]: 59: Hoare triple {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:33,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:33,970 INFO L273 TraceCheckUtils]: 61: Hoare triple {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:33,971 INFO L273 TraceCheckUtils]: 62: Hoare triple {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:33,972 INFO L273 TraceCheckUtils]: 63: Hoare triple {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:33,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:33,974 INFO L273 TraceCheckUtils]: 65: Hoare triple {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:33,975 INFO L273 TraceCheckUtils]: 66: Hoare triple {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:33,976 INFO L273 TraceCheckUtils]: 67: Hoare triple {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3802#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:33,977 INFO L273 TraceCheckUtils]: 68: Hoare triple {3802#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3802#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:33,978 INFO L273 TraceCheckUtils]: 69: Hoare triple {3802#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3780#false} is VALID [2018-11-14 19:21:33,978 INFO L256 TraceCheckUtils]: 70: Hoare triple {3780#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)); {3780#false} is VALID [2018-11-14 19:21:33,978 INFO L273 TraceCheckUtils]: 71: Hoare triple {3780#false} ~cond := #in~cond; {3780#false} is VALID [2018-11-14 19:21:33,978 INFO L273 TraceCheckUtils]: 72: Hoare triple {3780#false} assume ~cond == 0; {3780#false} is VALID [2018-11-14 19:21:33,979 INFO L273 TraceCheckUtils]: 73: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2018-11-14 19:21:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:33,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:33,994 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,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:21:34,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:21:34,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:34,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:34,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3779#true} is VALID [2018-11-14 19:21:34,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2018-11-14 19:21:34,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #38#return; {3779#true} is VALID [2018-11-14 19:21:34,428 INFO L256 TraceCheckUtils]: 3: Hoare triple {3779#true} call #t~ret1 := main(); {3779#true} is VALID [2018-11-14 19:21:34,429 INFO L273 TraceCheckUtils]: 4: Hoare triple {3779#true} ~x~0 := 0; {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:34,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:34,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:34,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {3781#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:34,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:34,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:34,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {3782#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:34,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:34,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:34,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {3783#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:34,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:34,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:34,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {3784#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:34,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:34,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:34,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {3785#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:34,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:34,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:34,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {3786#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:34,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:34,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:34,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {3787#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:34,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:34,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:34,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {3788#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:34,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:34,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:34,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {3789#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:34,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:34,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:34,453 INFO L273 TraceCheckUtils]: 34: Hoare triple {3790#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:34,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:34,454 INFO L273 TraceCheckUtils]: 36: Hoare triple {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:34,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {3791#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:34,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:34,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:34,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {3792#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:34,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:34,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:34,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {3793#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:34,462 INFO L273 TraceCheckUtils]: 44: Hoare triple {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:34,463 INFO L273 TraceCheckUtils]: 45: Hoare triple {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:34,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {3794#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:34,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:34,465 INFO L273 TraceCheckUtils]: 48: Hoare triple {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:34,466 INFO L273 TraceCheckUtils]: 49: Hoare triple {3795#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:34,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:34,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:34,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {3796#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:34,470 INFO L273 TraceCheckUtils]: 53: Hoare triple {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:34,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:34,471 INFO L273 TraceCheckUtils]: 55: Hoare triple {3797#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:34,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:34,473 INFO L273 TraceCheckUtils]: 57: Hoare triple {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:34,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {3798#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:34,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:34,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:34,476 INFO L273 TraceCheckUtils]: 61: Hoare triple {3799#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:34,477 INFO L273 TraceCheckUtils]: 62: Hoare triple {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:34,478 INFO L273 TraceCheckUtils]: 63: Hoare triple {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:34,479 INFO L273 TraceCheckUtils]: 64: Hoare triple {3800#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:34,480 INFO L273 TraceCheckUtils]: 65: Hoare triple {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:34,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:34,482 INFO L273 TraceCheckUtils]: 67: Hoare triple {3801#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4007#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:34,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {4007#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {4007#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:34,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {4007#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3780#false} is VALID [2018-11-14 19:21:34,484 INFO L256 TraceCheckUtils]: 70: Hoare triple {3780#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)); {3780#false} is VALID [2018-11-14 19:21:34,484 INFO L273 TraceCheckUtils]: 71: Hoare triple {3780#false} ~cond := #in~cond; {3780#false} is VALID [2018-11-14 19:21:34,484 INFO L273 TraceCheckUtils]: 72: Hoare triple {3780#false} assume ~cond == 0; {3780#false} is VALID [2018-11-14 19:21:34,484 INFO L273 TraceCheckUtils]: 73: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2018-11-14 19:21:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 19:21:34,518 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-11-14 19:21:34,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:34,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 19:21:34,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:34,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 19:21:34,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 19:21:34,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:21:34,615 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 25 states. [2018-11-14 19:21:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:37,546 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-14 19:21:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 19:21:37,547 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-11-14 19:21:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:21:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:21:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 85 transitions. [2018-11-14 19:21:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:21:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 85 transitions. [2018-11-14 19:21:37,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 85 transitions. [2018-11-14 19:21:38,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:38,114 INFO L225 Difference]: With dead ends: 97 [2018-11-14 19:21:38,114 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 19:21:38,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:21:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 19:21:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-14 19:21:38,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:21:38,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-14 19:21:38,265 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-14 19:21:38,265 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-14 19:21:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:38,267 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-14 19:21:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-14 19:21:38,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:38,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:38,267 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-14 19:21:38,267 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-14 19:21:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:21:38,269 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-14 19:21:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-14 19:21:38,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:21:38,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:21:38,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:21:38,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:21:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 19:21:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-11-14 19:21:38,272 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 74 [2018-11-14 19:21:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:21:38,272 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-11-14 19:21:38,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 19:21:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-14 19:21:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-14 19:21:38,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:21:38,273 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:21:38,273 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:21:38,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:21:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 631016285, now seen corresponding path program 9 times [2018-11-14 19:21:38,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:21:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:21:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:38,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:21:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:21:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:39,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {4431#true} call ULTIMATE.init(); {4431#true} is VALID [2018-11-14 19:21:39,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,351 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4431#true} {4431#true} #38#return; {4431#true} is VALID [2018-11-14 19:21:39,351 INFO L256 TraceCheckUtils]: 3: Hoare triple {4431#true} call #t~ret1 := main(); {4431#true} is VALID [2018-11-14 19:21:39,352 INFO L273 TraceCheckUtils]: 4: Hoare triple {4431#true} ~x~0 := 0; {4433#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:39,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {4433#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4433#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:39,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {4433#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4433#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:21:39,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {4433#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4434#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:39,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {4434#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {4434#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:39,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {4434#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4434#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:21:39,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {4434#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:39,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {4435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:39,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {4435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:21:39,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {4435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:39,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {4436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:39,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:21:39,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {4436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4437#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:39,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4437#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:39,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {4437#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4437#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:21:39,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {4437#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:39,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {4438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {4438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:39,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {4438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:21:39,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {4438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4439#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:39,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {4439#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4439#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:39,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {4439#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4439#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:21:39,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {4439#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:39,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {4440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {4440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:39,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {4440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:21:39,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {4440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:39,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {4441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:39,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {4441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:21:39,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {4441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4442#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:39,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {4442#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {4442#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:39,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {4442#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 268435455); {4442#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:21:39,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {4442#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:39,374 INFO L273 TraceCheckUtils]: 35: Hoare triple {4443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:39,374 INFO L273 TraceCheckUtils]: 36: Hoare triple {4443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:21:39,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {4443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4444#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:39,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {4444#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {4444#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:39,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {4444#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 268435455); {4444#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:21:39,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {4444#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:39,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {4445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:39,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {4445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:21:39,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {4445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:39,380 INFO L273 TraceCheckUtils]: 44: Hoare triple {4446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {4446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:39,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {4446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:21:39,382 INFO L273 TraceCheckUtils]: 46: Hoare triple {4446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4447#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:39,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {4447#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {4447#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:39,383 INFO L273 TraceCheckUtils]: 48: Hoare triple {4447#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4447#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:21:39,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {4447#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:39,385 INFO L273 TraceCheckUtils]: 50: Hoare triple {4448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {4448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:39,385 INFO L273 TraceCheckUtils]: 51: Hoare triple {4448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {4448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:21:39,386 INFO L273 TraceCheckUtils]: 52: Hoare triple {4448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:39,387 INFO L273 TraceCheckUtils]: 53: Hoare triple {4449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {4449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:39,387 INFO L273 TraceCheckUtils]: 54: Hoare triple {4449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:21:39,388 INFO L273 TraceCheckUtils]: 55: Hoare triple {4449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4450#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:39,389 INFO L273 TraceCheckUtils]: 56: Hoare triple {4450#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {4450#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:39,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {4450#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4450#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-14 19:21:39,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {4450#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:39,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {4451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {4451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:39,392 INFO L273 TraceCheckUtils]: 60: Hoare triple {4451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 19:21:39,393 INFO L273 TraceCheckUtils]: 61: Hoare triple {4451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4452#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-14 19:21:39,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {4452#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {4452#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-14 19:21:39,394 INFO L273 TraceCheckUtils]: 63: Hoare triple {4452#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4452#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-14 19:21:39,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {4452#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4453#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:39,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {4453#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {4453#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:39,396 INFO L273 TraceCheckUtils]: 66: Hoare triple {4453#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4453#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 19:21:39,397 INFO L273 TraceCheckUtils]: 67: Hoare triple {4453#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4454#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:39,398 INFO L273 TraceCheckUtils]: 68: Hoare triple {4454#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {4454#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:39,398 INFO L273 TraceCheckUtils]: 69: Hoare triple {4454#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4454#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 19:21:39,399 INFO L273 TraceCheckUtils]: 70: Hoare triple {4454#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4455#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:39,400 INFO L273 TraceCheckUtils]: 71: Hoare triple {4455#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {4455#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:39,401 INFO L273 TraceCheckUtils]: 72: Hoare triple {4455#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4455#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-14 19:21:39,402 INFO L273 TraceCheckUtils]: 73: Hoare triple {4455#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4456#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:39,402 INFO L273 TraceCheckUtils]: 74: Hoare triple {4456#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {4456#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:21:39,403 INFO L273 TraceCheckUtils]: 75: Hoare triple {4456#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4432#false} is VALID [2018-11-14 19:21:39,403 INFO L256 TraceCheckUtils]: 76: Hoare triple {4432#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)); {4432#false} is VALID [2018-11-14 19:21:39,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {4432#false} ~cond := #in~cond; {4432#false} is VALID [2018-11-14 19:21:39,404 INFO L273 TraceCheckUtils]: 78: Hoare triple {4432#false} assume ~cond == 0; {4432#false} is VALID [2018-11-14 19:21:39,404 INFO L273 TraceCheckUtils]: 79: Hoare triple {4432#false} assume !false; {4432#false} is VALID [2018-11-14 19:21:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:21:39,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:21:39,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:21:39,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:21:39,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 19:21:39,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:21:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:21:39,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:21:39,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {4431#true} call ULTIMATE.init(); {4431#true} is VALID [2018-11-14 19:21:39,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,649 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4431#true} {4431#true} #38#return; {4431#true} is VALID [2018-11-14 19:21:39,649 INFO L256 TraceCheckUtils]: 3: Hoare triple {4431#true} call #t~ret1 := main(); {4431#true} is VALID [2018-11-14 19:21:39,650 INFO L273 TraceCheckUtils]: 4: Hoare triple {4431#true} ~x~0 := 0; {4431#true} is VALID [2018-11-14 19:21:39,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 38: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 42: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 45: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 46: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 47: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 50: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 51: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 52: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 54: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 57: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,657 INFO L273 TraceCheckUtils]: 59: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,657 INFO L273 TraceCheckUtils]: 61: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4431#true} is VALID [2018-11-14 19:21:39,657 INFO L273 TraceCheckUtils]: 62: Hoare triple {4431#true} assume true; {4431#true} is VALID [2018-11-14 19:21:39,657 INFO L273 TraceCheckUtils]: 63: Hoare triple {4431#true} assume !!(~x~0 % 4294967296 < 268435455); {4431#true} is VALID [2018-11-14 19:21:39,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {4431#true} assume ~x~0 % 4294967296 < 65520;#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0; {4652#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {4652#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume true; {4652#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,659 INFO L273 TraceCheckUtils]: 66: Hoare triple {4652#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {4652#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,659 INFO L273 TraceCheckUtils]: 67: Hoare triple {4652#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4662#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {4662#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume true; {4662#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {4662#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {4662#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,661 INFO L273 TraceCheckUtils]: 70: Hoare triple {4662#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4672#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,661 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume true; {4672#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,662 INFO L273 TraceCheckUtils]: 72: Hoare triple {4672#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {4672#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,663 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#(< (mod (+ main_~x~0 4294967291) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := ~x~0 + 2; {4682#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,664 INFO L273 TraceCheckUtils]: 74: Hoare triple {4682#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} assume true; {4682#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} is VALID [2018-11-14 19:21:39,665 INFO L273 TraceCheckUtils]: 75: Hoare triple {4682#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {4432#false} is VALID [2018-11-14 19:21:39,665 INFO L256 TraceCheckUtils]: 76: Hoare triple {4432#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)); {4432#false} is VALID [2018-11-14 19:21:39,665 INFO L273 TraceCheckUtils]: 77: Hoare triple {4432#false} ~cond := #in~cond; {4432#false} is VALID [2018-11-14 19:21:39,665 INFO L273 TraceCheckUtils]: 78: Hoare triple {4432#false} assume ~cond == 0; {4432#false} is VALID [2018-11-14 19:21:39,666 INFO L273 TraceCheckUtils]: 79: Hoare triple {4432#false} assume !false; {4432#false} is VALID [2018-11-14 19:21:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 220 proven. 15 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-14 19:21:39,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:21:39,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6] total 30 [2018-11-14 19:21:39,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-11-14 19:21:39,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:21:39,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 19:21:39,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:21:39,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 19:21:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 19:21:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-11-14 19:21:39,794 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 30 states. [2018-11-14 19:21:44,350 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12