java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:12:18,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:12:18,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:12:18,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:12:18,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:12:18,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:12:18,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:12:18,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:12:18,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:12:18,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:12:18,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:12:18,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:12:18,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:12:18,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:12:18,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:12:18,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:12:18,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:12:18,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:12:18,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:12:18,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:12:18,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:12:18,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:12:18,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:12:18,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:12:18,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:12:18,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:12:18,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:12:18,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:12:18,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:12:18,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:12:18,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:12:18,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:12:18,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:12:18,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:12:18,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:12:18,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:12:18,706 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:12:18,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:12:18,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:12:18,723 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:12:18,724 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:12:18,724 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:12:18,724 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:12:18,724 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:12:18,725 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:12:18,725 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:12:18,725 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:12:18,725 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:12:18,725 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:12:18,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:12:18,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:12:18,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:12:18,727 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:12:18,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:12:18,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:12:18,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:12:18,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:12:18,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:12:18,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:12:18,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:12:18,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:12:18,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:12:18,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:12:18,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:12:18,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:12:18,730 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:12:18,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:12:18,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:12:18,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:12:18,731 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:12:18,731 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:12:18,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:12:18,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:12:18,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:12:18,811 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:12:18,811 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:12:18,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-07 05:12:18,880 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1400abe36/d78e10a90bf446c6aa2c288eba4d4305/FLAGcd4d265f4 [2018-11-07 05:12:19,383 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:12:19,384 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-07 05:12:19,390 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1400abe36/d78e10a90bf446c6aa2c288eba4d4305/FLAGcd4d265f4 [2018-11-07 05:12:19,405 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1400abe36/d78e10a90bf446c6aa2c288eba4d4305 [2018-11-07 05:12:19,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:12:19,417 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:12:19,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:12:19,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:12:19,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:12:19,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11afb146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19, skipping insertion in model container [2018-11-07 05:12:19,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:12:19,457 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:12:19,684 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:12:19,689 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:12:19,709 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:12:19,726 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:12:19,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19 WrapperNode [2018-11-07 05:12:19,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:12:19,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:12:19,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:12:19,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:12:19,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:12:19,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:12:19,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:12:19,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:12:19,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (1/1) ... [2018-11-07 05:12:19,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:12:19,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:12:19,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:12:19,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:12:19,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (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-07 05:12:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:12:19,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:12:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:12:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:12:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:12:19,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:12:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:12:19,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:12:20,177 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:12:20,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:12:20 BoogieIcfgContainer [2018-11-07 05:12:20,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:12:20,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:12:20,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:12:20,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:12:20,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:12:19" (1/3) ... [2018-11-07 05:12:20,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fadd3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:12:20, skipping insertion in model container [2018-11-07 05:12:20,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:12:19" (2/3) ... [2018-11-07 05:12:20,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fadd3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:12:20, skipping insertion in model container [2018-11-07 05:12:20,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:12:20" (3/3) ... [2018-11-07 05:12:20,186 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_true-unreach-call1.c [2018-11-07 05:12:20,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:12:20,205 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:12:20,222 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:12:20,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:12:20,265 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:12:20,266 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:12:20,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:12:20,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:12:20,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:12:20,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:12:20,267 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:12:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 05:12:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 05:12:20,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:20,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:20,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:20,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 05:12:20,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:20,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:20,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:20,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:20,432 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-07 05:12:20,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:12:20,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:12:20,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:12:20,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:12:20,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:12:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:12:20,459 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 05:12:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:20,481 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 05:12:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:12:20,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 05:12:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:20,493 INFO L225 Difference]: With dead ends: 30 [2018-11-07 05:12:20,493 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 05:12:20,497 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-07 05:12:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 05:12:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 05:12:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 05:12:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 05:12:20,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 05:12:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:20,533 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 05:12:20,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:12:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 05:12:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 05:12:20,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:20,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:20,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:20,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-07 05:12:20,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:20,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:20,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:20,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:20,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:20,682 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-07 05:12:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:12:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:12:20,684 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:12:20,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:12:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:12:20,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:12:20,687 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 05:12:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:20,789 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 05:12:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:12:20,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 05:12:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:20,796 INFO L225 Difference]: With dead ends: 24 [2018-11-07 05:12:20,796 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 05:12:20,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:12:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 05:12:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 05:12:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 05:12:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 05:12:20,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 05:12:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:20,803 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 05:12:20,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:12:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 05:12:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 05:12:20,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:20,805 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:20,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:20,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-07 05:12:20,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:20,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:20,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:20,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:20,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:20,947 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-07 05:12:20,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:20,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:20,949 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 05:12:20,951 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 05:12:21,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:12:21,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:12:21,110 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:12:21,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:12:21,300 INFO L272 AbstractInterpreter]: Visited 13 different actions 93 times. Merged at 4 different actions 42 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 05:12:21,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:21,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:12:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:21,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:21,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:21,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:21,387 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-07 05:12:21,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:21,686 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-07 05:12:21,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:21,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 9 [2018-11-07 05:12:21,714 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:21,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:12:21,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:12:21,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:12:21,715 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-07 05:12:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:21,778 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-07 05:12:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:12:21,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 05:12:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:21,780 INFO L225 Difference]: With dead ends: 27 [2018-11-07 05:12:21,780 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 05:12:21,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:12:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 05:12:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 05:12:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 05:12:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 05:12:21,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 05:12:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 05:12:21,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:12:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 05:12:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:12:21,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:21,788 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:21,788 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:21,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-07 05:12:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:21,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:22,011 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-07 05:12:22,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:22,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:22,012 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:22,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:22,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:22,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:22,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:22,023 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:22,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 05:12:22,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:22,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 05:12:22,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 05:12:22,265 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:12:22,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2018-11-07 05:12:22,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:12:22,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:12:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:12:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:12:22,266 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-07 05:12:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:22,356 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-07 05:12:22,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:12:22,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 05:12:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:22,359 INFO L225 Difference]: With dead ends: 27 [2018-11-07 05:12:22,359 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 05:12:22,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:12:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 05:12:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 05:12:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 05:12:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 05:12:22,373 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-07 05:12:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:22,373 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 05:12:22,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:12:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 05:12:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 05:12:22,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:22,375 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:22,375 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:22,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:22,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-07 05:12:22,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:22,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:22,378 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:22,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:22,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:22,528 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 05:12:22,529 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 05:12:22,530 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:12:22,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:12:22,535 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:12:22,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:12:22,713 INFO L272 AbstractInterpreter]: Visited 14 different actions 114 times. Merged at 5 different actions 46 times. Widened at 2 different actions 7 times. Found 12 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 05:12:22,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:22,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:12:22,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:22,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:22,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:22,741 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:22,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:22,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:23,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:23,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-07 05:12:23,010 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:23,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:12:23,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:12:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:12:23,012 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-07 05:12:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:23,369 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-07 05:12:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:12:23,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 05:12:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:23,371 INFO L225 Difference]: With dead ends: 34 [2018-11-07 05:12:23,371 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 05:12:23,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:12:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 05:12:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 05:12:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 05:12:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 05:12:23,380 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-07 05:12:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:23,381 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 05:12:23,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:12:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 05:12:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:12:23,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:23,382 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:23,383 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:23,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-07 05:12:23,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:23,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:23,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:23,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:23,573 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:23,573 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:23,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:23,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:23,574 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:23,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:23,583 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:23,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 05:12:23,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:23,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 05:12:23,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 05:12:23,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:23,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 7] total 14 [2018-11-07 05:12:23,860 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:23,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:12:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:12:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:12:23,862 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-07 05:12:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:26,305 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-07 05:12:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:12:26,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 05:12:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:26,307 INFO L225 Difference]: With dead ends: 44 [2018-11-07 05:12:26,307 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 05:12:26,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:12:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 05:12:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-07 05:12:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 05:12:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-07 05:12:26,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-07 05:12:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:26,313 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-07 05:12:26,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:12:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-07 05:12:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 05:12:26,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:26,315 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:26,315 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:26,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-07 05:12:26,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:26,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:26,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:26,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:26,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:26,496 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:26,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:26,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:26,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:26,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:26,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:26,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:26,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:26,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:12:26,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:12:26,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:26,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-07 05:12:26,890 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:12:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:12:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:12:26,892 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-07 05:12:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:26,980 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-07 05:12:26,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:12:26,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 05:12:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:26,982 INFO L225 Difference]: With dead ends: 46 [2018-11-07 05:12:26,982 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 05:12:26,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 05:12:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 05:12:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-07 05:12:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 05:12:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 05:12:26,989 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-11-07 05:12:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:26,990 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 05:12:26,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:12:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 05:12:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 05:12:26,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:26,992 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:26,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:26,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:26,992 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-07 05:12:26,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:26,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:26,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:26,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:26,994 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:27,322 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-07 05:12:27,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:27,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:27,322 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:27,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:27,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:27,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:27,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:27,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:27,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:12:27,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:12:27,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:27,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-07 05:12:27,838 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:12:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:12:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:12:27,840 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2018-11-07 05:12:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:28,000 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-07 05:12:28,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:12:28,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 05:12:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:28,003 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:12:28,003 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 05:12:28,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 05:12:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 05:12:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 05:12:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 05:12:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-07 05:12:28,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-11-07 05:12:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:28,010 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-07 05:12:28,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:12:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-07 05:12:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 05:12:28,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:28,011 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:28,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:28,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-07 05:12:28,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:28,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:28,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:28,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:28,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:28,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:28,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:28,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:28,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:28,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:28,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:28,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 05:12:28,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:28,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 05:12:28,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 05:12:28,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:28,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 8] total 20 [2018-11-07 05:12:28,493 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:28,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:12:28,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:12:28,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:12:28,494 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 14 states. [2018-11-07 05:12:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:29,057 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-07 05:12:29,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:12:29,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-07 05:12:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:29,061 INFO L225 Difference]: With dead ends: 59 [2018-11-07 05:12:29,061 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 05:12:29,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:12:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 05:12:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-07 05:12:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:12:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-07 05:12:29,073 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2018-11-07 05:12:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:29,074 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-07 05:12:29,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:12:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-07 05:12:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:12:29,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:29,076 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:29,076 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:29,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:29,080 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-07 05:12:29,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:29,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:29,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:29,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:29,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:29,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:29,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:29,317 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:29,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:29,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:29,318 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:29,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:29,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:29,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:29,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:29,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:30,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:30,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-07 05:12:30,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:30,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:12:30,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:12:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:12:30,016 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2018-11-07 05:12:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:30,258 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-07 05:12:30,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:12:30,259 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 05:12:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:30,260 INFO L225 Difference]: With dead ends: 61 [2018-11-07 05:12:30,261 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 05:12:30,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:12:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 05:12:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-07 05:12:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 05:12:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-07 05:12:30,268 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2018-11-07 05:12:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:30,268 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-07 05:12:30,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:12:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-07 05:12:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 05:12:30,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:30,270 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:30,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:30,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-07 05:12:30,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:30,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:30,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:30,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:30,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:30,556 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:30,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:30,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:30,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:30,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:30,569 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:30,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 05:12:30,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 05:12:31,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:31,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-07 05:12:31,557 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:31,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:12:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:12:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:12:31,559 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2018-11-07 05:12:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:31,799 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-07 05:12:31,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:12:31,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 05:12:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:31,801 INFO L225 Difference]: With dead ends: 64 [2018-11-07 05:12:31,801 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 05:12:31,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:12:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 05:12:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 05:12:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:12:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-07 05:12:31,809 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44 [2018-11-07 05:12:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:31,810 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-07 05:12:31,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:12:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-07 05:12:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 05:12:31,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:31,811 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:31,811 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:31,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-07 05:12:31,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:31,813 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:32,121 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-07 05:12:32,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:32,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:32,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:32,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:32,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:32,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:32,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:32,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:32,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 05:12:32,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:32,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 05:12:32,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 05:12:32,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:32,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 9] total 26 [2018-11-07 05:12:32,689 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:32,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:12:32,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:12:32,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:12:32,690 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 19 states. [2018-11-07 05:12:38,851 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 05:12:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:39,337 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-07 05:12:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:12:39,337 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-07 05:12:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:39,338 INFO L225 Difference]: With dead ends: 74 [2018-11-07 05:12:39,338 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 05:12:39,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-11-07 05:12:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 05:12:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 05:12:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 05:12:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 05:12:39,346 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 47 [2018-11-07 05:12:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:39,347 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 05:12:39,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:12:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 05:12:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 05:12:39,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:39,348 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:39,348 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:39,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-07 05:12:39,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:39,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:39,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:39,648 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-07 05:12:39,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:39,649 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:39,649 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:39,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:39,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:39,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:39,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:12:39,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:12:39,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:12:39,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:39,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 05:12:39,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 05:12:40,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:40,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-07 05:12:40,569 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:40,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:12:40,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:12:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 05:12:40,571 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-07 05:12:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:40,979 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-07 05:12:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:12:40,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 05:12:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:40,981 INFO L225 Difference]: With dead ends: 79 [2018-11-07 05:12:40,981 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 05:12:40,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 05:12:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 05:12:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-07 05:12:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 05:12:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 05:12:40,994 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 53 [2018-11-07 05:12:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:40,994 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 05:12:40,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:12:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 05:12:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 05:12:40,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:40,998 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:41,001 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:41,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 10 times [2018-11-07 05:12:41,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:41,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:12:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:41,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:41,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:41,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:41,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:41,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:41,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:41,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-07 05:12:41,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:41,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:12:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:41,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 05:12:41,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 05:12:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:42,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 33 [2018-11-07 05:12:42,740 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:12:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:12:42,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:12:42,741 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 19 states. [2018-11-07 05:12:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:12:43,157 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-07 05:12:43,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:12:43,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 05:12:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:12:43,159 INFO L225 Difference]: With dead ends: 85 [2018-11-07 05:12:43,159 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 05:12:43,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 05:12:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 05:12:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 05:12:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 05:12:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-07 05:12:43,171 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 59 [2018-11-07 05:12:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:12:43,172 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-07 05:12:43,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:12:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-07 05:12:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 05:12:43,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:12:43,173 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:12:43,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:12:43,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:12:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 369721150, now seen corresponding path program 11 times [2018-11-07 05:12:43,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:12:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:12:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:12:43,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:12:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:12:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:12:43,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:43,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:12:43,798 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:12:43,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:12:43,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:12:43,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:12:43,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:12:43,808 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:12:43,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 05:12:43,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:12:43,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:12:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 05:12:43,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:12:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 05:12:44,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:12:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 10] total 34 [2018-11-07 05:12:44,356 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:12:44,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 05:12:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 05:12:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:12:44,358 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 26 states. [2018-11-07 05:12:45,498 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 05:13:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:02,465 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2018-11-07 05:13:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:13:02,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-07 05:13:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:02,466 INFO L225 Difference]: With dead ends: 101 [2018-11-07 05:13:02,466 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 05:13:02,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=401, Invalid=1157, Unknown=2, NotChecked=0, Total=1560 [2018-11-07 05:13:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 05:13:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-11-07 05:13:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 05:13:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-07 05:13:02,476 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 65 [2018-11-07 05:13:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-07 05:13:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 05:13:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-07 05:13:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 05:13:02,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:02,479 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:02,479 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:02,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 10718589, now seen corresponding path program 12 times [2018-11-07 05:13:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:02,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:02,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:03,466 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-07 05:13:03,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:03,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:03,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:03,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:03,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:03,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:03,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:13:03,476 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:13:03,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:13:03,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:03,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:13:03,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:13:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 45 [2018-11-07 05:13:05,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:05,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 05:13:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 05:13:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 05:13:05,383 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 24 states. [2018-11-07 05:13:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:06,003 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-07 05:13:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:13:06,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 05:13:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:06,004 INFO L225 Difference]: With dead ends: 100 [2018-11-07 05:13:06,005 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 05:13:06,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 05:13:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 05:13:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 05:13:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 05:13:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-07 05:13:06,016 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 74 [2018-11-07 05:13:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:06,016 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-07 05:13:06,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 05:13:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-07 05:13:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 05:13:06,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:06,018 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:06,018 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:06,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1880758400, now seen corresponding path program 13 times [2018-11-07 05:13:06,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:06,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:13:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:06,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:13:06,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:06,595 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:06,596 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:06,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:06,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:06,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:06,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:06,604 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:13:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:06,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 05:13:06,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 456 refuted. 3 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 05:13:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 44 [2018-11-07 05:13:10,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 05:13:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 05:13:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1368, Unknown=1, NotChecked=0, Total=1892 [2018-11-07 05:13:10,661 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 25 states. [2018-11-07 05:13:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:13:11,447 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-07 05:13:11,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 05:13:11,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 05:13:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:13:11,448 INFO L225 Difference]: With dead ends: 103 [2018-11-07 05:13:11,449 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 05:13:11,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=523, Invalid=1368, Unknown=1, NotChecked=0, Total=1892 [2018-11-07 05:13:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 05:13:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-07 05:13:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 05:13:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-07 05:13:11,458 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 77 [2018-11-07 05:13:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:13:11,458 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-07 05:13:11,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 05:13:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-07 05:13:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 05:13:11,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:13:11,459 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:13:11,460 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:13:11,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:13:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2078995811, now seen corresponding path program 14 times [2018-11-07 05:13:11,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:13:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:13:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:13:11,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:13:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:13:12,170 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-07 05:13:12,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:12,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:13:12,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:13:12,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:13:12,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:13:12,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:13:12,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:13:12,183 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:13:12,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 05:13:12,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:13:12,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:13:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 05:13:12,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:13:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 05:13:13,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:13:13,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 11] total 41 [2018-11-07 05:13:13,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:13:13,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 05:13:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 05:13:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 05:13:13,511 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 32 states. [2018-11-07 05:13:16,412 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2018-11-07 05:13:20,959 WARN L179 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 05:13:28,700 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 05:14:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:14:02,603 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-11-07 05:14:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 05:14:02,604 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-07 05:14:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:14:02,605 INFO L225 Difference]: With dead ends: 120 [2018-11-07 05:14:02,605 INFO L226 Difference]: Without dead ends: 98 [2018-11-07 05:14:02,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 149 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=595, Invalid=1755, Unknown=6, NotChecked=94, Total=2450 [2018-11-07 05:14:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-07 05:14:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2018-11-07 05:14:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 05:14:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-07 05:14:02,615 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 80 [2018-11-07 05:14:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:14:02,616 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-07 05:14:02,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 05:14:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-07 05:14:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 05:14:02,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:14:02,617 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:14:02,617 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:14:02,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:14:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash 59221243, now seen corresponding path program 15 times [2018-11-07 05:14:02,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:14:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:14:02,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:14:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:14:02,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:14:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:14:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:14:03,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:14:03,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:14:03,821 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:14:03,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:14:03,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:14:03,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:14:03,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:14:03,830 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:14:03,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:14:03,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:14:03,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:14:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:14:03,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:14:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:14:06,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:14:06,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 23] total 49 [2018-11-07 05:14:06,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:14:06,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 05:14:06,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 05:14:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 05:14:06,962 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 28 states. [2018-11-07 05:14:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:14:07,740 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-07 05:14:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 05:14:07,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 05:14:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:14:07,742 INFO L225 Difference]: With dead ends: 118 [2018-11-07 05:14:07,742 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 05:14:07,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 05:14:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 05:14:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-07 05:14:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 05:14:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-11-07 05:14:07,753 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 86 [2018-11-07 05:14:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:14:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-11-07 05:14:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 05:14:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-11-07 05:14:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 05:14:07,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:14:07,754 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:14:07,755 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:14:07,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:14:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1341754853, now seen corresponding path program 16 times [2018-11-07 05:14:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:14:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:14:07,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:14:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:14:07,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:14:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:14:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:14:08,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:14:08,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:14:08,961 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:14:08,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:14:08,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:14:08,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:14:08,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:14:08,969 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:14:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:14:08,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:14:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:14:09,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:14:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 05:14:11,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:14:11,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 53 [2018-11-07 05:14:11,442 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:14:11,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 05:14:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 05:14:11,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 05:14:11,444 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 30 states. [2018-11-07 05:14:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:14:12,640 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-07 05:14:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:14:12,641 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-07 05:14:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:14:12,642 INFO L225 Difference]: With dead ends: 124 [2018-11-07 05:14:12,642 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 05:14:12,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 05:14:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 05:14:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-07 05:14:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 05:14:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-11-07 05:14:12,651 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 92 [2018-11-07 05:14:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:14:12,651 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-07 05:14:12,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 05:14:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-07 05:14:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 05:14:12,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:14:12,652 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:14:12,652 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:14:12,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:14:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2143361221, now seen corresponding path program 17 times [2018-11-07 05:14:12,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:14:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:14:12,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:14:12,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:14:12,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:14:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:14:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:14:13,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:14:13,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:14:13,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:14:13,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:14:13,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:14:13,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:14:13,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:14:13,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:14:53,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 05:14:53,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:14:53,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:14:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 05:14:54,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:14:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 05:14:54,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:14:54,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 12] total 49 [2018-11-07 05:14:54,601 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:14:54,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 05:14:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 05:14:54,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 05:14:54,603 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 39 states. [2018-11-07 05:15:11,911 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-07 05:15:15,530 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 05:15:24,819 WARN L179 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 05:15:30,711 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2018-11-07 05:16:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:16:50,993 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-11-07 05:16:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 05:16:50,994 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 98 [2018-11-07 05:16:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:16:50,996 INFO L225 Difference]: With dead ends: 150 [2018-11-07 05:16:50,996 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 05:16:50,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 184 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 78.8s TimeCoverageRelationStatistics Valid=920, Invalid=2613, Unknown=11, NotChecked=116, Total=3660 [2018-11-07 05:16:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 05:16:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2018-11-07 05:16:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 05:16:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-11-07 05:16:51,007 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 98 [2018-11-07 05:16:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:16:51,008 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-11-07 05:16:51,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 05:16:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-07 05:16:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 05:16:51,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:16:51,008 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:16:51,009 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:16:51,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:16:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1159676448, now seen corresponding path program 18 times [2018-11-07 05:16:51,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:16:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:16:51,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:16:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:16:51,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:16:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:16:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 155 proven. 1395 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:16:52,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:16:52,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:16:52,552 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:16:52,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:16:52,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:16:52,552 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:16:52,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:16:52,562 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:16:52,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:16:52,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:16:52,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:16:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:16:52,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:16:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 520 proven. 975 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 05:16:55,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:16:55,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 29] total 61 [2018-11-07 05:16:55,525 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:16:55,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 05:16:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 05:16:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=2645, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 05:16:55,527 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 34 states. Received shutdown request... [2018-11-07 05:16:56,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:16:56,272 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:16:56,278 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:16:56,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:16:56 BoogieIcfgContainer [2018-11-07 05:16:56,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:16:56,279 INFO L168 Benchmark]: Toolchain (without parser) took 276862.49 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.4 MB). Peak memory consumption was 256.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:16:56,280 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:16:56,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:16:56,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:16:56,281 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:16:56,282 INFO L168 Benchmark]: RCFGBuilder took 398.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -814.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-07 05:16:56,283 INFO L168 Benchmark]: TraceAbstraction took 276099.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 301.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -2.2 MB). Peak memory consumption was 299.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:16:56,286 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 398.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -814.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 276099.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 301.5 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -2.2 MB). Peak memory consumption was 299.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (108states) and FLOYD_HOARE automaton (currently 22 states, 34 states before enhancement),while ReachableStatesComputation was computing reachable states (62 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 276.0s OverallTime, 22 OverallIterations, 33 TraceHistogramMax, 199.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 475 SDtfs, 327 SDslu, 5927 SDs, 0 SdLazy, 9670 SolverSat, 501 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 78.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2593 GetRequests, 1935 SyntacticMatches, 57 SemanticMatches, 601 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 146.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 48 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 41.0s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 2207 NumberOfCodeBlocks, 2030 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 3238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1401192 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1620 ConjunctsInSsa, 473 ConjunctsInUnsatCore, 62 InterpolantComputations, 4 PerfectInterpolantSequences, 10407/27405 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown